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/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:42:48,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:42:48,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:42:48,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:42:48,729 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:42:48,730 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:42:48,731 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:42:48,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:42:48,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:42:48,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:42:48,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:42:48,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:42:48,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:42:48,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:42:48,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:42:48,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:42:48,741 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:42:48,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:42:48,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:42:48,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:42:48,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:42:48,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:42:48,752 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:42:48,752 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:42:48,752 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:42:48,753 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:42:48,754 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:42:48,755 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:42:48,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:42:48,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:42:48,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:42:48,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:42:48,761 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:42:48,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:42:48,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:42:48,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:42:48,764 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:42:48,789 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:42:48,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:42:48,790 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:42:48,790 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:42:48,791 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:42:48,791 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:42:48,791 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:42:48,791 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:42:48,791 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:42:48,792 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:42:48,792 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:42:48,792 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:42:48,792 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:42:48,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:42:48,793 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:42:48,793 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:42:48,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:42:48,794 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:42:48,794 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:42:48,794 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:42:48,794 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:42:48,794 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:42:48,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:42:48,795 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:42:48,795 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:42:48,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:42:48,795 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:42:48,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:42:48,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:42:48,796 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:42:48,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:42:48,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:42:48,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:42:48,797 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:42:48,797 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:42:48,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:42:48,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:42:48,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:42:48,798 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:42:48,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:42:48,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:42:48,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:42:48,863 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:42:48,864 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:42:48,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-02-28 10:42:48,865 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-02-28 10:42:48,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:42:48,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:42:48,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:42:48,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:42:48,902 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:42:48,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,940 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:42:48,940 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:42:48,940 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:42:48,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:42:48,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:42:48,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:42:48,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:42:48,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/1) ... [2019-02-28 10:42:48,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:42:48,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:42:48,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:42:49,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:42:49,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:42:49,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-02-28 10:42:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:42:49,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:42:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-28 10:42:49,420 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:42:49,420 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-28 10:42:49,422 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:42:49 BoogieIcfgContainer [2019-02-28 10:42:49,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:42:49,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:42:49,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:42:49,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:42:49,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:42:48" (1/2) ... [2019-02-28 10:42:49,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f444cab and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:42:49, skipping insertion in model container [2019-02-28 10:42:49,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:42:49" (2/2) ... [2019-02-28 10:42:49,434 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-02-28 10:42:49,444 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:42:49,454 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:42:49,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:42:49,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:42:49,509 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:42:49,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:42:49,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:42:49,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:42:49,510 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:42:49,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:42:49,510 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:42:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-28 10:42:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:42:49,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:49,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:42:49,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-28 10:42:49,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:49,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:42:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:42:49,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:42:49,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:42:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:42:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:42:49,748 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-02-28 10:42:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:49,929 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-02-28 10:42:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:42:49,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:42:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:49,942 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:42:49,942 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:42:49,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:42:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:42:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-02-28 10:42:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:42:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 10:42:49,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-28 10:42:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:49,976 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 10:42:49,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:42:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 10:42:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:42:49,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:49,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:42:49,977 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-02-28 10:42:49,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:50,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:42:50,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:42:50,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:42:50,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:42:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:42:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:42:50,120 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-02-28 10:42:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:50,352 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-02-28 10:42:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:42:50,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:42:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:50,356 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:42:50,356 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:42:50,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:42:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:42:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-02-28 10:42:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:42:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-28 10:42:50,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-02-28 10:42:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:50,371 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-28 10:42:50,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:42:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-28 10:42:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:42:50,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:50,374 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-28 10:42:50,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-02-28 10:42:50,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:50,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:50,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:50,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:50,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:42:50,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:42:50,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:42:50,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:42:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:42:50,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:42:50,438 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-02-28 10:42:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:50,454 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-02-28 10:42:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:42:50,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-02-28 10:42:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:50,455 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:42:50,455 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:42:50,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:42:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:42:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:42:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:42:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-28 10:42:50,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-02-28 10:42:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:50,463 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-28 10:42:50,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:42:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 10:42:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:42:50,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:50,464 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-02-28 10:42:50,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-02-28 10:42:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:50,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:50,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:50,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:50,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-28 10:42:50,668 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-02-28 10:42:50,732 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:42:50,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:43:21,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:43:21,809 INFO L272 AbstractInterpreter]: Visited 7 different actions 85 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:43:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:21,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:43:21,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:21,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:21,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:21,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:21,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:43:21,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:21,993 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:21,994 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:22,110 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:22,112 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:22,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:22,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:22,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:43:22,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:22,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:43:22,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:43:22,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:43:22,864 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-02-28 10:43:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:23,123 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:43:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:43:23,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-02-28 10:43:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:23,125 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:43:23,125 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:43:23,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:43:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:43:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-02-28 10:43:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:43:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:43:23,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-02-28 10:43:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:23,130 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:43:23,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:43:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:43:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:43:23,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:23,132 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-02-28 10:43:23,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-02-28 10:43:23,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:23,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:23,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:23,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:23,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:23,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:23,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:23,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:23,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:23,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:23,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:23,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:43:23,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:23,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:43:23,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:23,387 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:23,387 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:23,483 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:23,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:23,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:23,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:23,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:43:23,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:23,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:43:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:43:23,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:43:23,898 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-02-28 10:43:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:24,104 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-28 10:43:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:43:24,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-02-28 10:43:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:24,108 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:43:24,108 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:43:24,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:43:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:43:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-02-28 10:43:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:43:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-28 10:43:24,113 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-02-28 10:43:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:24,114 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-28 10:43:24,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:43:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-28 10:43:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:43:24,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:24,115 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-02-28 10:43:24,115 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:24,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:24,116 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-02-28 10:43:24,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:24,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:24,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:24,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:24,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:24,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:24,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:24,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:24,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:24,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:24,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:24,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:24,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:24,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:24,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:24,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:43:24,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:24,328 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:24,328 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:24,348 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:24,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:24,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:24,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:24,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:43:24,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:24,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:43:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:43:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:43:24,610 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-28 10:43:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:24,781 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:43:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:43:24,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-28 10:43:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:24,785 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:43:24,785 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:43:24,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:43:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:43:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-02-28 10:43:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:43:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:43:24,791 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-02-28 10:43:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:24,791 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:43:24,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:43:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:43:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:43:24,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:24,792 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-02-28 10:43:24,792 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-02-28 10:43:24,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:24,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:24,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:24,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:24,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:24,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:24,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:24,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:24,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:24,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:24,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:24,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:24,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:24,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:43:24,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:25,001 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:25,002 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:25,016 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:25,017 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:25,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:25,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:43:25,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:43:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:43:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:43:25,719 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-02-28 10:43:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:25,974 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-28 10:43:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:43:25,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-02-28 10:43:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:25,977 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:43:25,977 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:43:25,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:43:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:43:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-02-28 10:43:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:43:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-28 10:43:25,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-02-28 10:43:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:25,983 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-28 10:43:25,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:43:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-28 10:43:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:43:25,984 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:25,984 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-02-28 10:43:25,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:25,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-02-28 10:43:25,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:25,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:25,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:25,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:25,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:26,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:26,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:26,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:26,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:26,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:26,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:26,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:26,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:26,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:43:26,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:26,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:43:26,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:26,158 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:26,158 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:26,171 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:26,171 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:26,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:26,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-28 10:43:26,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:26,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:43:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:43:26,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:43:26,498 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-02-28 10:43:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:27,069 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:43:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:43:27,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-28 10:43:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:27,072 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:43:27,072 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:43:27,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:43:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:43:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-02-28 10:43:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:43:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:43:27,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-02-28 10:43:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:27,079 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:43:27,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:43:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:43:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:43:27,080 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:27,080 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-02-28 10:43:27,080 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:27,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-02-28 10:43:27,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:27,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:27,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:27,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:27,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:27,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:27,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:27,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:27,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:27,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:27,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:27,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:27,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:27,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:27,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:43:27,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:27,312 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:27,312 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:27,321 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:27,321 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:27,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:27,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:27,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-28 10:43:27,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:27,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:43:27,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:43:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:43:27,645 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-02-28 10:43:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:27,944 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-28 10:43:27,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:43:27,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-02-28 10:43:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:27,945 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:43:27,945 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:43:27,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:43:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:43:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-02-28 10:43:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:43:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-28 10:43:27,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-02-28 10:43:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:27,954 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-28 10:43:27,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:43:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-28 10:43:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:43:27,955 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:27,955 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-02-28 10:43:27,955 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-02-28 10:43:27,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:27,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:27,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:28,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:28,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:28,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:28,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:28,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:28,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:28,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:28,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:28,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:43:28,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:28,190 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:28,191 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:28,200 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:28,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:28,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:28,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:28,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-28 10:43:28,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:28,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:43:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:43:28,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:43:28,764 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-02-28 10:43:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:29,089 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:43:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:43:29,094 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-02-28 10:43:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:29,095 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:43:29,095 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:43:29,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:43:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:43:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-02-28 10:43:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:43:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:43:29,108 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-02-28 10:43:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:29,108 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:43:29,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:43:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:43:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:43:29,111 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:29,111 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-02-28 10:43:29,111 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:29,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-02-28 10:43:29,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:29,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:29,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:29,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:29,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:29,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:29,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:29,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:29,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:29,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:29,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:43:29,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:29,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:43:29,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:29,638 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:29,639 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:29,697 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:29,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:29,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:30,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:30,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-28 10:43:30,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:30,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:43:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:43:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:43:30,035 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-02-28 10:43:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:30,334 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-28 10:43:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:43:30,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-02-28 10:43:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:30,336 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:43:30,336 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:43:30,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:43:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:43:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-02-28 10:43:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:43:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-28 10:43:30,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-02-28 10:43:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:30,345 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-28 10:43:30,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:43:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-28 10:43:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:43:30,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:30,346 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-02-28 10:43:30,346 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-02-28 10:43:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:30,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:30,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:30,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:30,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:30,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:30,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:30,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:30,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:30,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:30,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:30,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:30,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:30,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:30,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:43:30,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:30,725 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:30,725 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:30,735 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:30,735 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:30,957 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:31,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:31,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-28 10:43:31,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:31,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:43:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:43:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:43:31,169 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-02-28 10:43:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:31,556 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:43:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:43:31,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-02-28 10:43:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:31,557 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:43:31,558 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:43:31,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:43:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:43:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-02-28 10:43:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:43:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:43:31,568 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-02-28 10:43:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:31,568 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:43:31,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:43:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:43:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:43:31,569 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:31,569 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-02-28 10:43:31,570 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-02-28 10:43:31,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:31,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:31,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:32,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:32,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:32,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:32,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:32,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:32,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:32,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:32,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:43:32,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:32,526 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:32,526 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:32,538 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:32,538 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:32,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:33,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:33,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-28 10:43:33,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:33,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:43:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:43:33,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:43:33,059 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-02-28 10:43:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:33,439 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-28 10:43:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:43:33,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-28 10:43:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:33,440 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:43:33,440 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:43:33,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:43:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:43:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-02-28 10:43:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:43:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-28 10:43:33,451 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-02-28 10:43:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:33,452 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-28 10:43:33,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:43:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-28 10:43:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:43:33,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:33,453 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-02-28 10:43:33,453 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:33,454 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-02-28 10:43:33,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:33,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:33,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:33,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:33,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:33,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:33,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:33,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:33,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:33,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:33,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:33,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:33,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:43:33,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:33,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:43:33,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:33,955 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:33,955 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:33,961 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:33,962 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:34,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:34,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:34,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-28 10:43:34,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:34,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:43:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:43:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:43:34,442 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-02-28 10:43:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:34,900 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:43:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:43:34,901 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-02-28 10:43:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:34,901 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:43:34,901 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:43:34,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:43:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:43:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-02-28 10:43:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:43:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:43:34,916 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-02-28 10:43:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:34,916 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:43:34,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:43:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:43:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:43:34,917 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:34,917 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-02-28 10:43:34,918 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-02-28 10:43:34,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:34,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:34,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:35,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:35,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:35,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:35,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:35,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:35,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:35,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:35,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:35,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:35,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:35,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:43:35,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:35,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:35,820 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:35,870 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:35,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:36,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:36,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-28 10:43:36,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:36,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:43:36,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:43:36,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:43:36,704 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-02-28 10:43:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:37,148 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-28 10:43:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:43:37,148 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-02-28 10:43:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:37,149 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:43:37,149 INFO L226 Difference]: Without dead ends: 74 [2019-02-28 10:43:37,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:43:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-28 10:43:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-02-28 10:43:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:43:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-28 10:43:37,161 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-02-28 10:43:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:37,162 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-28 10:43:37,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:43:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-28 10:43:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:43:37,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:37,163 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-02-28 10:43:37,163 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-02-28 10:43:37,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:37,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:37,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:37,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:37,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:37,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:37,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:37,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:37,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:37,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:37,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:38,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:43:38,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:38,029 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:38,029 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:38,038 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:38,038 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:38,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:39,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:39,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-28 10:43:39,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:39,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:43:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:43:39,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:43:39,296 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-02-28 10:43:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:39,814 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:43:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:43:39,814 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-02-28 10:43:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:39,815 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:43:39,815 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:43:39,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:43:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:43:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-02-28 10:43:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:43:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:43:39,826 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-02-28 10:43:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:39,826 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:43:39,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:43:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:43:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:43:39,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:39,828 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-02-28 10:43:39,828 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-02-28 10:43:39,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:39,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:39,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:40,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:40,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:40,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:40,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:40,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:40,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:40,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:40,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:43:40,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:40,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:43:40,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:40,334 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:40,334 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:40,347 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:40,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:40,625 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:41,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:41,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-28 10:43:41,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:41,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:43:41,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:43:41,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:43:41,242 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-02-28 10:43:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:41,886 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-28 10:43:41,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:43:41,886 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-02-28 10:43:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:41,887 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:43:41,888 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:43:41,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:43:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:43:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-02-28 10:43:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:43:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-28 10:43:41,902 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-02-28 10:43:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:41,902 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-28 10:43:41,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:43:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-28 10:43:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:43:41,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:41,904 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-02-28 10:43:41,904 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-02-28 10:43:41,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:41,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:41,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:42,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:42,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:42,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:42,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:42,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:42,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:42,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:42,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:42,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:42,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:43:42,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:42,329 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:42,330 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:42,338 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:42,339 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:44,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-28 10:43:45,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:45,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:43:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:43:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:43:45,307 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-02-28 10:43:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:46,143 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:43:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:43:46,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-02-28 10:43:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:46,144 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:43:46,145 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:43:46,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:43:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:43:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-02-28 10:43:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:43:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:43:46,158 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-02-28 10:43:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:46,158 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:43:46,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:43:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:43:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:43:46,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:46,159 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-02-28 10:43:46,160 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-02-28 10:43:46,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:46,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:46,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:46,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:46,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:46,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:46,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:46,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:46,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:46,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:46,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:46,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:43:46,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:46,588 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:46,588 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:46,599 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:46,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:46,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:47,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:47,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-28 10:43:47,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:47,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:43:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:43:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:43:47,387 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-02-28 10:43:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:47,968 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-28 10:43:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:43:47,969 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-02-28 10:43:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:47,969 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:43:47,970 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:43:47,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:43:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:43:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-02-28 10:43:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:43:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-28 10:43:47,982 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-02-28 10:43:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:47,983 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-28 10:43:47,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:43:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-28 10:43:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:43:47,984 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:47,984 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-02-28 10:43:47,984 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:47,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:47,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-02-28 10:43:47,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:47,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:47,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:47,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:47,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:48,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:48,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:48,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:48,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:48,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:48,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:48,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:48,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:48,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:43:48,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:48,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:43:48,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:48,439 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:48,439 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:48,452 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:48,452 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:48,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:49,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:49,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-28 10:43:49,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:49,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:43:49,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:43:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:43:49,444 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-02-28 10:43:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:50,155 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:43:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:43:50,155 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-02-28 10:43:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:50,157 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:43:50,157 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:43:50,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:43:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:43:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-02-28 10:43:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:43:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:43:50,168 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-02-28 10:43:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:50,169 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:43:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:43:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:43:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:43:50,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:50,169 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-02-28 10:43:50,170 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-02-28 10:43:50,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:50,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:50,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:50,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:50,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:50,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:50,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:50,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:50,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:50,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:50,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:50,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:43:50,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:50,707 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:50,708 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:50,719 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:50,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:51,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:51,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:51,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-28 10:43:51,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:51,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:43:51,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:43:51,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:43:51,846 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-02-28 10:43:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:52,506 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-28 10:43:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:43:52,506 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-02-28 10:43:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:52,507 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:43:52,507 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:43:52,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:43:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:43:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-02-28 10:43:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:43:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-28 10:43:52,519 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-02-28 10:43:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-28 10:43:52,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:43:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-28 10:43:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:43:52,519 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:52,519 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-02-28 10:43:52,520 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-02-28 10:43:52,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:52,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:52,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:53,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:53,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:53,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:53,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:43:53,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:53,194 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:53,194 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:53,206 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:53,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:54,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:54,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-28 10:43:54,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:54,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:43:54,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:43:54,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:43:54,245 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-02-28 10:43:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:54,987 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:43:54,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:43:54,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-02-28 10:43:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:54,991 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:43:54,991 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:43:54,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:43:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:43:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-02-28 10:43:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:43:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:43:55,003 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-02-28 10:43:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:55,003 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:43:55,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:43:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:43:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:43:55,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:55,004 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-02-28 10:43:55,004 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-02-28 10:43:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:55,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:55,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:55,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:55,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:55,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:55,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:55,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:55,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:55,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:55,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:55,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:43:55,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:55,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:43:55,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:55,789 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:55,790 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:55,801 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:55,802 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:56,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:57,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:57,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-28 10:43:57,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:57,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:43:57,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:43:57,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:43:57,187 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-02-28 10:43:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:57,986 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-28 10:43:57,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:43:57,986 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-02-28 10:43:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:57,987 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:43:57,987 INFO L226 Difference]: Without dead ends: 114 [2019-02-28 10:43:57,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:43:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-28 10:43:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-02-28 10:43:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:43:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-28 10:43:58,002 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-02-28 10:43:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:58,002 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-28 10:43:58,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:43:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-28 10:43:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:43:58,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:58,003 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-02-28 10:43:58,004 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-02-28 10:43:58,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:58,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:58,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:58,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:58,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:58,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:58,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:58,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:58,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:58,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:58,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:58,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:58,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:58,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:58,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:58,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:43:58,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:58,632 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:58,633 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:58,732 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:58,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:59,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:00,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:00,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-28 10:44:00,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:00,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:44:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:44:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:44:00,199 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-02-28 10:44:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:01,105 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-28 10:44:01,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:44:01,106 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-02-28 10:44:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:01,106 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:44:01,107 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:44:01,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:44:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:44:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-02-28 10:44:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-28 10:44:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-28 10:44:01,125 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-02-28 10:44:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:01,125 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-28 10:44:01,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:44:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-28 10:44:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-28 10:44:01,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:01,126 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-02-28 10:44:01,126 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-02-28 10:44:01,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:01,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:01,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:02,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:02,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:02,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:02,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:02,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:02,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:02,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:02,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:02,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:44:02,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:02,131 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:02,131 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:02,141 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:02,142 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:02,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:03,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:03,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-28 10:44:03,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:03,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:44:03,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:44:03,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:44:03,381 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-02-28 10:44:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:04,417 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-02-28 10:44:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:44:04,417 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-02-28 10:44:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:04,418 INFO L225 Difference]: With dead ends: 125 [2019-02-28 10:44:04,418 INFO L226 Difference]: Without dead ends: 124 [2019-02-28 10:44:04,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:44:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-28 10:44:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-02-28 10:44:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:44:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-28 10:44:04,439 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-02-28 10:44:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:04,440 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-28 10:44:04,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:44:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-28 10:44:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-28 10:44:04,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:04,441 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-02-28 10:44:04,441 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-02-28 10:44:04,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:04,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:04,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:05,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:05,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:05,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:05,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:05,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:05,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:05,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:05,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:44:05,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:05,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:44:05,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:05,608 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:05,608 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:05,616 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:05,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:06,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:07,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:07,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-28 10:44:07,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:07,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:44:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:44:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:44:07,231 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-02-28 10:44:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:08,179 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-28 10:44:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:44:08,180 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-02-28 10:44:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:08,181 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:44:08,181 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:44:08,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:44:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:44:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-02-28 10:44:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-28 10:44:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-28 10:44:08,199 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-02-28 10:44:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:08,199 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-28 10:44:08,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:44:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-28 10:44:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-28 10:44:08,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:08,200 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-02-28 10:44:08,200 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-02-28 10:44:08,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:08,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:08,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:08,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:08,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:08,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:08,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:08,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:08,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:08,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:08,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:08,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:08,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:08,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:44:08,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:08,864 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:08,865 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:08,910 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:08,910 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:09,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:10,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:10,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-28 10:44:10,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:10,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:44:10,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:44:10,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:44:10,355 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-02-28 10:44:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:11,299 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-28 10:44:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:44:11,300 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-02-28 10:44:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:11,301 INFO L225 Difference]: With dead ends: 135 [2019-02-28 10:44:11,301 INFO L226 Difference]: Without dead ends: 134 [2019-02-28 10:44:11,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:44:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-28 10:44:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-02-28 10:44:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-28 10:44:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-02-28 10:44:11,323 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-02-28 10:44:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:11,324 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-02-28 10:44:11,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:44:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-02-28 10:44:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-28 10:44:11,325 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:11,325 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-02-28 10:44:11,325 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-02-28 10:44:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:11,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:11,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:12,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:12,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:12,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:12,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:12,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:12,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:12,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:12,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:12,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:44:12,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:12,187 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:12,187 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:12,196 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:12,196 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:12,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:13,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:13,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-28 10:44:13,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:13,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:44:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:44:13,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:44:13,721 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-02-28 10:44:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:14,831 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-28 10:44:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:44:14,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-02-28 10:44:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:14,834 INFO L225 Difference]: With dead ends: 140 [2019-02-28 10:44:14,834 INFO L226 Difference]: Without dead ends: 139 [2019-02-28 10:44:14,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:44:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-28 10:44:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-02-28 10:44:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:44:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-28 10:44:14,854 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-02-28 10:44:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:14,854 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-28 10:44:14,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:44:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-28 10:44:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-28 10:44:14,855 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:14,855 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-02-28 10:44:14,855 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:14,856 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-02-28 10:44:14,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:14,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:14,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:14,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:14,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:15,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:15,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:15,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:15,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:15,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:15,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:15,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:15,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:15,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:44:15,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:15,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:44:15,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:15,632 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:15,632 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:15,720 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:15,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:17,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:18,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:18,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-28 10:44:18,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:18,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:44:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:44:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:44:18,304 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-02-28 10:44:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:19,410 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-02-28 10:44:19,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:44:19,410 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-02-28 10:44:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:19,411 INFO L225 Difference]: With dead ends: 145 [2019-02-28 10:44:19,411 INFO L226 Difference]: Without dead ends: 144 [2019-02-28 10:44:19,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:44:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-28 10:44:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-02-28 10:44:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-28 10:44:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-28 10:44:19,431 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-02-28 10:44:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:19,431 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-28 10:44:19,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:44:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-28 10:44:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-28 10:44:19,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:19,432 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-02-28 10:44:19,432 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:19,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:19,432 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-02-28 10:44:19,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:19,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:19,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:19,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:19,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:20,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:20,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:20,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:20,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:20,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:20,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:20,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:20,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:20,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:20,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:20,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:44:20,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:20,451 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:20,451 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:20,460 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:20,460 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:21,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:22,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:22,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-28 10:44:22,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:22,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:44:22,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:44:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:44:22,752 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-02-28 10:44:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:23,942 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-02-28 10:44:23,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:44:23,943 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-02-28 10:44:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:23,944 INFO L225 Difference]: With dead ends: 150 [2019-02-28 10:44:23,944 INFO L226 Difference]: Without dead ends: 149 [2019-02-28 10:44:23,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:44:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-28 10:44:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-02-28 10:44:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-02-28 10:44:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-02-28 10:44:23,968 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-02-28 10:44:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:23,968 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-02-28 10:44:23,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:44:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-02-28 10:44:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-02-28 10:44:23,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:23,969 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-02-28 10:44:23,969 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-02-28 10:44:23,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:23,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:23,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:23,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:23,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:24,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:24,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:24,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:24,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:24,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:24,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:24,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:24,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:24,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:44:24,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:24,953 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:24,953 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:24,962 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:24,962 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:25,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:26,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:26,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-28 10:44:26,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:26,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:44:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:44:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:44:26,862 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-02-28 10:44:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:28,080 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-28 10:44:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:44:28,080 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-02-28 10:44:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:28,081 INFO L225 Difference]: With dead ends: 155 [2019-02-28 10:44:28,081 INFO L226 Difference]: Without dead ends: 154 [2019-02-28 10:44:28,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:44:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-28 10:44:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-02-28 10:44:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-28 10:44:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-02-28 10:44:28,102 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-02-28 10:44:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-02-28 10:44:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:44:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-02-28 10:44:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-28 10:44:28,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:28,103 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-02-28 10:44:28,103 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-02-28 10:44:28,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:28,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:28,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:28,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:28,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:28,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:28,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:28,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:28,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:28,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:28,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:28,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:44:28,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:28,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:44:28,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:28,956 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:28,956 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:28,964 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:28,965 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:30,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:31,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:31,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-28 10:44:31,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:31,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:44:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:44:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:44:31,472 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-02-28 10:44:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:32,976 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-02-28 10:44:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:44:32,977 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-02-28 10:44:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:32,978 INFO L225 Difference]: With dead ends: 160 [2019-02-28 10:44:32,978 INFO L226 Difference]: Without dead ends: 159 [2019-02-28 10:44:32,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:44:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-28 10:44:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-02-28 10:44:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-02-28 10:44:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-02-28 10:44:33,006 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-02-28 10:44:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:33,006 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-02-28 10:44:33,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:44:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-02-28 10:44:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-02-28 10:44:33,007 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:33,007 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-02-28 10:44:33,008 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:33,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-02-28 10:44:33,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:33,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:33,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:33,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:33,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:33,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:33,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:33,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:33,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:33,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:33,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:33,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:33,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:33,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:33,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:33,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:44:33,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:33,986 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:33,986 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:33,995 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:33,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:34,690 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:36,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:36,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-28 10:44:36,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:36,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:44:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:44:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:44:36,124 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-02-28 10:44:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:37,668 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-02-28 10:44:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:44:37,668 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-02-28 10:44:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:37,669 INFO L225 Difference]: With dead ends: 165 [2019-02-28 10:44:37,669 INFO L226 Difference]: Without dead ends: 164 [2019-02-28 10:44:37,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:44:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-28 10:44:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-02-28 10:44:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:44:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-28 10:44:37,697 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-02-28 10:44:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:37,697 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-28 10:44:37,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:44:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-28 10:44:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:44:37,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:37,699 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-02-28 10:44:37,699 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-02-28 10:44:37,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:37,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:37,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:37,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:37,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:38,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:38,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:38,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:38,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:38,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:38,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:38,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:38,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:38,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:44:38,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:38,606 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:38,606 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:38,615 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:38,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:39,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:40,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:40,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-28 10:44:40,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:40,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:44:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:44:40,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:44:40,834 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-02-28 10:44:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:42,891 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-02-28 10:44:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:44:42,892 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-02-28 10:44:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:42,893 INFO L225 Difference]: With dead ends: 170 [2019-02-28 10:44:42,893 INFO L226 Difference]: Without dead ends: 169 [2019-02-28 10:44:42,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:44:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-28 10:44:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-02-28 10:44:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-02-28 10:44:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-02-28 10:44:42,922 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-02-28 10:44:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:42,922 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-02-28 10:44:42,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:44:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-02-28 10:44:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-02-28 10:44:42,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:42,924 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-02-28 10:44:42,924 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:42,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-02-28 10:44:42,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:42,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:42,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:43,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:43,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:43,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:43,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:43,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:43,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:43,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:44,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-28 10:44:44,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:44,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:44:44,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:44,072 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:44,073 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:44,081 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:44,082 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:44,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:47,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:47,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-28 10:44:47,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:47,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:44:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:44:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:44:47,060 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-02-28 10:44:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:48,692 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-28 10:44:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:44:48,693 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-02-28 10:44:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:48,694 INFO L225 Difference]: With dead ends: 175 [2019-02-28 10:44:48,694 INFO L226 Difference]: Without dead ends: 174 [2019-02-28 10:44:48,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:44:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-28 10:44:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-02-28 10:44:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-28 10:44:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-02-28 10:44:48,729 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-02-28 10:44:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:48,730 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-02-28 10:44:48,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:44:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-02-28 10:44:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-28 10:44:48,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:48,731 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-02-28 10:44:48,731 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-02-28 10:44:48,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:48,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:48,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:49,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:49,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:49,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:49,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:49,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:49,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:49,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:49,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:49,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:49,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:49,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-28 10:44:49,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:49,856 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:49,856 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,867 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,867 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:50,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:52,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-28 10:44:52,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:52,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:44:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:44:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:44:52,460 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-02-28 10:44:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:54,037 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-02-28 10:44:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:44:54,038 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-02-28 10:44:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:54,039 INFO L225 Difference]: With dead ends: 180 [2019-02-28 10:44:54,039 INFO L226 Difference]: Without dead ends: 179 [2019-02-28 10:44:54,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:44:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-28 10:44:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-02-28 10:44:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-28 10:44:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-02-28 10:44:54,064 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-02-28 10:44:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:54,064 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-02-28 10:44:54,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:44:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-02-28 10:44:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-02-28 10:44:54,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:54,066 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-02-28 10:44:54,066 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-02-28 10:44:54,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:54,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:54,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:54,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:54,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:54,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:54,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:54,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:54,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:54,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:54,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:54,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:54,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:44:54,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:55,013 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:55,014 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:55,096 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:55,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:56,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-28 10:44:58,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:44:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:44:58,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:44:58,106 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-02-28 10:44:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:59,878 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-02-28 10:44:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:44:59,879 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-02-28 10:44:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:59,880 INFO L225 Difference]: With dead ends: 185 [2019-02-28 10:44:59,880 INFO L226 Difference]: Without dead ends: 184 [2019-02-28 10:44:59,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:44:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-28 10:44:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-02-28 10:44:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-28 10:44:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-28 10:44:59,914 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-02-28 10:44:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:59,914 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-28 10:44:59,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:44:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-28 10:44:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-28 10:44:59,915 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:59,916 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-02-28 10:44:59,916 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-02-28 10:44:59,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:59,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:59,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:01,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:01,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:01,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:01,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:01,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:01,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:01,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:01,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:45:01,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:01,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-28 10:45:01,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:01,646 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:01,647 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:01,743 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:01,744 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:03,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:04,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:04,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-28 10:45:04,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:04,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:45:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:45:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:45:04,874 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-02-28 10:45:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:06,436 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-02-28 10:45:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:45:06,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-02-28 10:45:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:06,437 INFO L225 Difference]: With dead ends: 190 [2019-02-28 10:45:06,437 INFO L226 Difference]: Without dead ends: 189 [2019-02-28 10:45:06,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:45:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-28 10:45:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-02-28 10:45:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-28 10:45:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-02-28 10:45:06,472 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-02-28 10:45:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:06,472 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-02-28 10:45:06,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:45:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-02-28 10:45:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-02-28 10:45:06,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:06,473 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-02-28 10:45:06,474 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-02-28 10:45:06,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:06,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:06,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:06,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:06,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:07,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:07,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:07,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:07,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:07,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:07,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:07,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:07,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:07,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:07,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:07,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-28 10:45:07,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:07,573 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:07,573 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:07,670 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:07,670 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:09,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:11,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:11,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-28 10:45:11,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:11,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:45:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:45:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:45:11,480 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-02-28 10:45:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:13,603 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-28 10:45:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:45:13,603 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-02-28 10:45:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:13,604 INFO L225 Difference]: With dead ends: 195 [2019-02-28 10:45:13,604 INFO L226 Difference]: Without dead ends: 194 [2019-02-28 10:45:13,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:45:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-28 10:45:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-02-28 10:45:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-28 10:45:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-02-28 10:45:13,646 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-02-28 10:45:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:13,646 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-02-28 10:45:13,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:45:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-02-28 10:45:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-28 10:45:13,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:13,648 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-02-28 10:45:13,648 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-02-28 10:45:13,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:13,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:13,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:14,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:14,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:14,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:14,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:14,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:14,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:14,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:14,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 128 conjunts are in the unsatisfiable core [2019-02-28 10:45:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:14,698 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:14,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:14,767 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:14,767 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:15,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-28 10:45:17,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:17,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:45:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:45:17,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:45:17,809 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-02-28 10:45:18,569 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:20,316 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-02-28 10:45:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:45:20,317 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-02-28 10:45:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:20,318 INFO L225 Difference]: With dead ends: 200 [2019-02-28 10:45:20,318 INFO L226 Difference]: Without dead ends: 199 [2019-02-28 10:45:20,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:45:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-28 10:45:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-02-28 10:45:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-28 10:45:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-02-28 10:45:20,351 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-02-28 10:45:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:20,351 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-02-28 10:45:20,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:45:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-02-28 10:45:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-28 10:45:20,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:20,352 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-02-28 10:45:20,352 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-02-28 10:45:20,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:20,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:20,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:20,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:20,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:21,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:21,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:21,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:21,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:21,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:21,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:21,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:21,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:21,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-28 10:45:21,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:21,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-28 10:45:21,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:21,578 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:21,578 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:21,590 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:21,590 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:22,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:25,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:25,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-28 10:45:25,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:25,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:45:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:45:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:45:25,097 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-02-28 10:45:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:27,064 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-02-28 10:45:27,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:45:27,064 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-02-28 10:45:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:27,065 INFO L225 Difference]: With dead ends: 205 [2019-02-28 10:45:27,065 INFO L226 Difference]: Without dead ends: 204 [2019-02-28 10:45:27,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:45:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-28 10:45:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-02-28 10:45:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-28 10:45:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-28 10:45:27,096 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-02-28 10:45:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:27,096 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-28 10:45:27,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:45:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-28 10:45:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-28 10:45:27,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:27,097 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-02-28 10:45:27,097 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-02-28 10:45:27,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:27,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:27,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:28,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:28,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:28,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:28,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:28,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:28,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:28,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:28,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:28,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:28,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-28 10:45:28,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:28,297 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:28,297 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:28,307 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:28,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:29,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:31,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:31,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-28 10:45:31,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:31,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:45:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:45:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:45:31,738 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-02-28 10:45:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:33,843 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-02-28 10:45:33,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:45:33,843 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-02-28 10:45:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:33,844 INFO L225 Difference]: With dead ends: 210 [2019-02-28 10:45:33,844 INFO L226 Difference]: Without dead ends: 209 [2019-02-28 10:45:33,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:45:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-28 10:45:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-02-28 10:45:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-28 10:45:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-02-28 10:45:33,878 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-02-28 10:45:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:33,879 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-02-28 10:45:33,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:45:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-02-28 10:45:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-28 10:45:33,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:33,880 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-02-28 10:45:33,880 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-02-28 10:45:33,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:33,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:33,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:33,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:35,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:35,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:35,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:35,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:35,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:35,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:35,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:35,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 137 conjunts are in the unsatisfiable core [2019-02-28 10:45:35,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:35,648 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:35,648 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:35,666 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:35,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:36,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:39,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:39,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-28 10:45:39,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:39,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:45:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:45:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:45:39,587 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-02-28 10:45:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:41,512 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-28 10:45:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:45:41,513 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-02-28 10:45:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:41,514 INFO L225 Difference]: With dead ends: 215 [2019-02-28 10:45:41,514 INFO L226 Difference]: Without dead ends: 214 [2019-02-28 10:45:41,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:45:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-28 10:45:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-02-28 10:45:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-28 10:45:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-02-28 10:45:41,549 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-02-28 10:45:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:41,550 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-02-28 10:45:41,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:45:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-02-28 10:45:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-28 10:45:41,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:41,551 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-02-28 10:45:41,551 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-02-28 10:45:41,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:41,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:41,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:42,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:42,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:42,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:42,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:42,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:42,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:42,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:43,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-28 10:45:43,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:43,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-28 10:45:43,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:43,398 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:43,399 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:43,415 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:43,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:44,871 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:47,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:47,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-28 10:45:47,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:47,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:45:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:45:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:45:47,333 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-02-28 10:45:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:49,565 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-02-28 10:45:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:45:49,565 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-02-28 10:45:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:49,566 INFO L225 Difference]: With dead ends: 220 [2019-02-28 10:45:49,566 INFO L226 Difference]: Without dead ends: 219 [2019-02-28 10:45:49,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:45:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-02-28 10:45:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-02-28 10:45:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-02-28 10:45:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-02-28 10:45:49,627 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-02-28 10:45:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:49,628 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-02-28 10:45:49,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:45:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-02-28 10:45:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-02-28 10:45:49,629 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:49,629 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-02-28 10:45:49,629 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-02-28 10:45:49,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:49,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:49,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:50,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:50,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:50,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:50,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:50,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:50,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:50,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:50,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:50,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:50,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:50,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-28 10:45:50,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:50,907 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:50,907 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:50,918 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:50,918 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:52,136 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:54,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:54,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-28 10:45:54,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:54,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:45:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:45:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:45:54,977 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-02-28 10:45:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:57,107 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-02-28 10:45:57,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:45:57,107 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-02-28 10:45:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:57,108 INFO L225 Difference]: With dead ends: 225 [2019-02-28 10:45:57,109 INFO L226 Difference]: Without dead ends: 224 [2019-02-28 10:45:57,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:45:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-02-28 10:45:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-02-28 10:45:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-28 10:45:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-28 10:45:57,147 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-02-28 10:45:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:57,147 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-28 10:45:57,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:45:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-28 10:45:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-28 10:45:57,148 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:57,148 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-02-28 10:45:57,148 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-02-28 10:45:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:57,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:57,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:58,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:58,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:58,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:58,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:58,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:58,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 146 conjunts are in the unsatisfiable core [2019-02-28 10:45:58,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:58,410 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:58,410 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:58,452 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:58,453 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:59,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:02,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-28 10:46:02,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:02,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:46:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:46:02,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-02-28 10:46:02,707 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-02-28 10:46:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:05,260 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-02-28 10:46:05,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:46:05,261 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-02-28 10:46:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:05,262 INFO L225 Difference]: With dead ends: 230 [2019-02-28 10:46:05,262 INFO L226 Difference]: Without dead ends: 229 [2019-02-28 10:46:05,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:46:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-02-28 10:46:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-02-28 10:46:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-28 10:46:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-02-28 10:46:05,310 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-02-28 10:46:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:05,311 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-02-28 10:46:05,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:46:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-02-28 10:46:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-02-28 10:46:05,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:05,312 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-02-28 10:46:05,312 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-02-28 10:46:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:05,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:05,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:05,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:05,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:06,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:06,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:06,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:06,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:06,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:06,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:06,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:06,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:06,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-28 10:46:06,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:06,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-28 10:46:06,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:06,997 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:06,997 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:07,008 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:07,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:08,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:11,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:11,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-28 10:46:11,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:11,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:46:11,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:46:11,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:46:11,767 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-02-28 10:46:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:14,209 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-28 10:46:14,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:46:14,209 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-02-28 10:46:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:14,210 INFO L225 Difference]: With dead ends: 235 [2019-02-28 10:46:14,211 INFO L226 Difference]: Without dead ends: 234 [2019-02-28 10:46:14,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:46:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-28 10:46:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-02-28 10:46:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-28 10:46:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-02-28 10:46:14,269 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-02-28 10:46:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-02-28 10:46:14,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:46:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-02-28 10:46:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-28 10:46:14,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:14,271 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-02-28 10:46:14,271 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-02-28 10:46:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:14,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:14,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:15,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:15,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:15,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:15,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:15,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:15,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:15,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:15,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:15,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:15,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-28 10:46:15,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:15,677 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:15,677 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:15,688 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:15,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:17,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:20,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:20,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-28 10:46:20,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:20,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:46:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:46:20,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-02-28 10:46:20,036 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-02-28 10:46:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:22,420 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-02-28 10:46:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:46:22,420 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-02-28 10:46:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:22,421 INFO L225 Difference]: With dead ends: 240 [2019-02-28 10:46:22,421 INFO L226 Difference]: Without dead ends: 239 [2019-02-28 10:46:22,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:46:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-28 10:46:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-02-28 10:46:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-28 10:46:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-02-28 10:46:22,481 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-02-28 10:46:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:22,481 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-02-28 10:46:22,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:46:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-02-28 10:46:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-02-28 10:46:22,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:22,483 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-02-28 10:46:22,483 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-02-28 10:46:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:22,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:22,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:23,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:23,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:23,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:23,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:23,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:23,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:23,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:23,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:23,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-28 10:46:23,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:23,893 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:23,894 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:23,913 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:23,913 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:25,570 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:28,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-28 10:46:28,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:28,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:46:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:46:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:46:28,708 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-02-28 10:46:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:31,500 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-02-28 10:46:31,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:46:31,508 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-02-28 10:46:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:31,509 INFO L225 Difference]: With dead ends: 245 [2019-02-28 10:46:31,509 INFO L226 Difference]: Without dead ends: 244 [2019-02-28 10:46:31,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:46:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-02-28 10:46:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-02-28 10:46:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-28 10:46:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-28 10:46:31,564 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-02-28 10:46:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:31,564 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-28 10:46:31,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:46:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-28 10:46:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-28 10:46:31,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:31,565 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-02-28 10:46:31,565 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-02-28 10:46:31,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:31,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:31,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:31,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:31,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:32,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:32,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:32,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:32,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:32,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:32,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:32,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:32,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:33,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-28 10:46:33,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:33,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-28 10:46:33,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:33,147 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:33,147 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:33,155 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:33,155 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:34,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:37,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:37,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-28 10:46:37,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:37,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:46:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:46:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-02-28 10:46:37,803 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-02-28 10:46:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:40,577 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-02-28 10:46:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:46:40,578 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-02-28 10:46:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:40,579 INFO L225 Difference]: With dead ends: 250 [2019-02-28 10:46:40,579 INFO L226 Difference]: Without dead ends: 249 [2019-02-28 10:46:40,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:46:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-28 10:46:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-02-28 10:46:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-02-28 10:46:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-02-28 10:46:40,634 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-02-28 10:46:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:40,634 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-02-28 10:46:40,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:46:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-02-28 10:46:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-02-28 10:46:40,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:40,635 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-02-28 10:46:40,635 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-02-28 10:46:40,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:40,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:40,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:41,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:41,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:41,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:41,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:41,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:41,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:41,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:42,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:42,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:42,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-28 10:46:42,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:42,101 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:42,101 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:42,110 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:42,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:43,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:47,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:47,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-28 10:46:47,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:47,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:46:47,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:46:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:46:47,463 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-02-28 10:46:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:50,441 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-28 10:46:50,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:46:50,441 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-02-28 10:46:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:50,442 INFO L225 Difference]: With dead ends: 255 [2019-02-28 10:46:50,443 INFO L226 Difference]: Without dead ends: 254 [2019-02-28 10:46:50,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:46:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-28 10:46:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-02-28 10:46:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-02-28 10:46:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-02-28 10:46:50,511 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-02-28 10:46:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:50,511 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-02-28 10:46:50,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:46:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-02-28 10:46:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-02-28 10:46:50,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:50,513 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-02-28 10:46:50,513 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-02-28 10:46:50,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:50,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:50,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:50,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:51,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:51,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:51,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:51,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:51,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:51,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:51,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:51,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:52,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 164 conjunts are in the unsatisfiable core [2019-02-28 10:46:52,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:52,045 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:52,046 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:52,053 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:52,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:53,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-02-28 10:46:57,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:57,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:46:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:46:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:46:57,417 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-02-28 10:47:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:00,097 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-02-28 10:47:00,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:47:00,097 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-02-28 10:47:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:00,099 INFO L225 Difference]: With dead ends: 260 [2019-02-28 10:47:00,099 INFO L226 Difference]: Without dead ends: 259 [2019-02-28 10:47:00,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:47:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-28 10:47:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-02-28 10:47:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-02-28 10:47:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-02-28 10:47:00,151 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-02-28 10:47:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:00,152 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-02-28 10:47:00,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:47:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-02-28 10:47:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-02-28 10:47:00,153 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:00,153 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-02-28 10:47:00,153 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-02-28 10:47:00,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:00,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:00,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:00,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:01,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:01,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:01,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:01,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:01,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:01,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:02,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-28 10:47:02,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:02,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-28 10:47:02,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:02,152 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:02,152 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:02,160 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:02,161 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:03,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:07,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:07,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-02-28 10:47:07,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:07,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:47:07,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:47:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:47:07,627 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-02-28 10:47:10,008 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:47:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:11,323 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-02-28 10:47:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:47:11,323 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-02-28 10:47:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:11,324 INFO L225 Difference]: With dead ends: 265 [2019-02-28 10:47:11,324 INFO L226 Difference]: Without dead ends: 264 [2019-02-28 10:47:11,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:47:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-28 10:47:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-02-28 10:47:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-28 10:47:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-28 10:47:11,377 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-02-28 10:47:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:11,377 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-28 10:47:11,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:47:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-28 10:47:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-28 10:47:11,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:11,379 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-02-28 10:47:11,379 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-02-28 10:47:11,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:11,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:11,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:12,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:12,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:12,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:12,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:12,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:12,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:12,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:12,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:12,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:12,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-28 10:47:12,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:13,000 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:13,001 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:13,012 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:13,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:14,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:18,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-02-28 10:47:18,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:18,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:47:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:47:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:47:18,544 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-02-28 10:47:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:21,656 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-02-28 10:47:21,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:47:21,656 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-02-28 10:47:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:21,657 INFO L225 Difference]: With dead ends: 270 [2019-02-28 10:47:21,657 INFO L226 Difference]: Without dead ends: 269 [2019-02-28 10:47:21,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:47:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-28 10:47:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-02-28 10:47:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-02-28 10:47:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-02-28 10:47:21,719 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-02-28 10:47:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:21,720 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-02-28 10:47:21,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:47:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-02-28 10:47:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-02-28 10:47:21,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:21,721 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-02-28 10:47:21,721 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-02-28 10:47:21,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:21,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:21,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:23,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:23,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:23,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:23,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:23,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:23,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:23,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:23,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 173 conjunts are in the unsatisfiable core [2019-02-28 10:47:23,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:23,380 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:23,381 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:23,394 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:23,394 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:25,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:29,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:29,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-02-28 10:47:29,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:29,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:47:29,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:47:29,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:47:29,013 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-02-28 10:47:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:32,191 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-28 10:47:32,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:47:32,191 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-02-28 10:47:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:32,192 INFO L225 Difference]: With dead ends: 275 [2019-02-28 10:47:32,192 INFO L226 Difference]: Without dead ends: 274 [2019-02-28 10:47:32,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:47:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-28 10:47:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-02-28 10:47:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-28 10:47:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-02-28 10:47:32,246 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-02-28 10:47:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:32,246 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-02-28 10:47:32,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:47:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-02-28 10:47:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-02-28 10:47:32,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:32,248 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-02-28 10:47:32,248 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-02-28 10:47:32,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:32,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:32,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:33,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:33,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:33,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:33,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:33,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:33,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:33,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:33,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:34,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-28 10:47:34,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:34,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-28 10:47:34,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:34,248 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:34,248 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:34,261 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:34,261 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:36,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:39,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:39,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-02-28 10:47:39,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:39,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:47:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:47:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-02-28 10:47:39,854 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-02-28 10:47:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:43,069 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-02-28 10:47:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:47:43,070 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-02-28 10:47:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:43,071 INFO L225 Difference]: With dead ends: 280 [2019-02-28 10:47:43,071 INFO L226 Difference]: Without dead ends: 279 [2019-02-28 10:47:43,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:47:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-28 10:47:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-02-28 10:47:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-28 10:47:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-02-28 10:47:43,132 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-02-28 10:47:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:43,133 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-02-28 10:47:43,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:47:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-02-28 10:47:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-28 10:47:43,134 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:43,134 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-02-28 10:47:43,135 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-02-28 10:47:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:43,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:43,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:44,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:44,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:44,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:44,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:44,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:44,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:44,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:44,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:44,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:44,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:44,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-28 10:47:44,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:44,987 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:44,987 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:44,995 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:44,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:47,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:50,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:50,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-02-28 10:47:50,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:50,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-28 10:47:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-28 10:47:50,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:47:50,721 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-02-28 10:47:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:53,964 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-02-28 10:47:53,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:47:53,965 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-02-28 10:47:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:53,966 INFO L225 Difference]: With dead ends: 285 [2019-02-28 10:47:53,966 INFO L226 Difference]: Without dead ends: 284 [2019-02-28 10:47:53,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:47:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-28 10:47:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-02-28 10:47:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-28 10:47:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-28 10:47:54,021 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-02-28 10:47:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:54,022 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-28 10:47:54,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-28 10:47:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-28 10:47:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-28 10:47:54,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:54,023 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-02-28 10:47:54,023 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-02-28 10:47:54,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:54,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:54,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:55,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:55,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:55,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:55,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:55,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:55,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:55,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:55,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:55,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 182 conjunts are in the unsatisfiable core [2019-02-28 10:47:55,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:55,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:55,820 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:55,828 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:55,828 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:58,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:01,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:01,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-02-28 10:48:01,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:01,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-28 10:48:01,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-28 10:48:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:48:01,784 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-02-28 10:48:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:05,080 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-02-28 10:48:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:48:05,080 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-02-28 10:48:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:05,081 INFO L225 Difference]: With dead ends: 290 [2019-02-28 10:48:05,082 INFO L226 Difference]: Without dead ends: 289 [2019-02-28 10:48:05,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:48:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-28 10:48:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-02-28 10:48:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-02-28 10:48:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-02-28 10:48:05,141 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-02-28 10:48:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:05,141 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-02-28 10:48:05,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-28 10:48:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-02-28 10:48:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-02-28 10:48:05,143 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:05,143 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-02-28 10:48:05,143 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-02-28 10:48:05,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:05,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:06,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:06,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:06,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:06,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:06,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:06,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:06,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:06,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:07,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-28 10:48:07,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:07,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-28 10:48:07,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:07,288 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:07,288 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:07,298 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:07,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:09,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:13,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:13,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-02-28 10:48:13,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:13,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-28 10:48:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-28 10:48:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:48:13,413 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-02-28 10:48:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:16,674 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-28 10:48:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:48:16,674 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-02-28 10:48:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:16,675 INFO L225 Difference]: With dead ends: 295 [2019-02-28 10:48:16,675 INFO L226 Difference]: Without dead ends: 294 [2019-02-28 10:48:16,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:48:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-28 10:48:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-02-28 10:48:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-02-28 10:48:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-02-28 10:48:16,741 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-02-28 10:48:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:16,741 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-02-28 10:48:16,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-28 10:48:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-02-28 10:48:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-02-28 10:48:16,742 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:16,742 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-02-28 10:48:16,742 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-02-28 10:48:16,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:16,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:16,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:18,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:18,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:18,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:18,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:18,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:18,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:18,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:18,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:18,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:18,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:18,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-28 10:48:18,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:18,984 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:18,984 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:18,992 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:18,992 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:21,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:25,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:25,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-02-28 10:48:25,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:25,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-28 10:48:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-28 10:48:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:48:25,027 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-02-28 10:48:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:28,563 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-02-28 10:48:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:48:28,564 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-02-28 10:48:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:28,565 INFO L225 Difference]: With dead ends: 300 [2019-02-28 10:48:28,565 INFO L226 Difference]: Without dead ends: 299 [2019-02-28 10:48:28,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:48:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-02-28 10:48:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-02-28 10:48:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-02-28 10:48:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-02-28 10:48:28,638 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-02-28 10:48:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:28,638 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-02-28 10:48:28,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-28 10:48:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-02-28 10:48:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-02-28 10:48:28,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:28,640 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-02-28 10:48:28,640 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-02-28 10:48:28,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:28,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:28,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:30,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:30,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:30,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:30,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:30,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:30,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:30,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:30,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 191 conjunts are in the unsatisfiable core [2019-02-28 10:48:30,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:30,682 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:30,682 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:30,690 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:30,691 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:33,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:37,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:37,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-02-28 10:48:37,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:37,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-28 10:48:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-28 10:48:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:48:37,243 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-02-28 10:48:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:40,997 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-02-28 10:48:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:48:40,997 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-02-28 10:48:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:40,999 INFO L225 Difference]: With dead ends: 305 [2019-02-28 10:48:40,999 INFO L226 Difference]: Without dead ends: 304 [2019-02-28 10:48:41,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:48:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-02-28 10:48:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-02-28 10:48:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-28 10:48:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-28 10:48:41,065 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-02-28 10:48:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:41,065 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-28 10:48:41,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-28 10:48:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-28 10:48:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-28 10:48:41,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:41,066 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-02-28 10:48:41,067 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-02-28 10:48:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:41,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:41,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:43,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:43,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:43,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:43,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:43,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:43,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:43,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:43,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-28 10:48:43,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:43,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-28 10:48:43,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:43,514 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:43,514 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,523 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:43,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:45,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:49,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:49,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-02-28 10:48:49,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:49,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-28 10:48:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-28 10:48:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:48:49,761 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-02-28 10:48:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:53,576 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-02-28 10:48:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:48:53,576 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-02-28 10:48:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:53,577 INFO L225 Difference]: With dead ends: 310 [2019-02-28 10:48:53,577 INFO L226 Difference]: Without dead ends: 309 [2019-02-28 10:48:53,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-02-28 10:48:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-02-28 10:48:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-02-28 10:48:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-02-28 10:48:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-02-28 10:48:53,642 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-02-28 10:48:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:53,642 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-02-28 10:48:53,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-28 10:48:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-02-28 10:48:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-02-28 10:48:53,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:53,643 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-02-28 10:48:53,643 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-02-28 10:48:53,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:53,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:53,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:55,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:55,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:55,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:55,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:55,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:55,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:55,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:55,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:55,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:55,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-28 10:48:55,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:55,672 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:55,672 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:55,680 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:55,680 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:58,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:02,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:02,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-02-28 10:49:02,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:02,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-28 10:49:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-28 10:49:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:49:02,192 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-02-28 10:49:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:06,033 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-28 10:49:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:49:06,033 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-02-28 10:49:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:06,034 INFO L225 Difference]: With dead ends: 315 [2019-02-28 10:49:06,034 INFO L226 Difference]: Without dead ends: 314 [2019-02-28 10:49:06,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-02-28 10:49:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-28 10:49:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-02-28 10:49:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-02-28 10:49:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-02-28 10:49:06,115 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-02-28 10:49:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:06,115 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-02-28 10:49:06,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-28 10:49:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-02-28 10:49:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-02-28 10:49:06,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:06,116 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-02-28 10:49:06,116 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-02-28 10:49:06,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:06,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:06,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:08,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:08,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:08,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:08,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:08,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:08,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:08,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:08,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 200 conjunts are in the unsatisfiable core [2019-02-28 10:49:08,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:08,270 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:08,270 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:08,281 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:08,282 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:10,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:14,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:14,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-02-28 10:49:14,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:14,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-28 10:49:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-28 10:49:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-02-28 10:49:14,961 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-02-28 10:49:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:18,855 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-02-28 10:49:18,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:49:18,855 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-02-28 10:49:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:18,856 INFO L225 Difference]: With dead ends: 320 [2019-02-28 10:49:18,857 INFO L226 Difference]: Without dead ends: 319 [2019-02-28 10:49:18,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-02-28 10:49:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-02-28 10:49:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-02-28 10:49:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-02-28 10:49:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-02-28 10:49:18,927 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-02-28 10:49:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:18,927 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-02-28 10:49:18,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-28 10:49:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-02-28 10:49:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-02-28 10:49:18,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:18,929 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-02-28 10:49:18,929 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-02-28 10:49:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:18,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:18,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:18,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:20,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:20,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:20,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:20,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:20,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:20,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:20,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:20,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:21,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-28 10:49:21,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:21,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-28 10:49:21,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:21,452 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:21,452 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:21,464 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:21,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:24,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:28,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-02-28 10:49:28,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:28,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-28 10:49:28,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-28 10:49:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:49:28,192 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-02-28 10:49:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:31,969 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-02-28 10:49:31,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:49:31,970 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-02-28 10:49:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:31,971 INFO L225 Difference]: With dead ends: 325 [2019-02-28 10:49:31,971 INFO L226 Difference]: Without dead ends: 324 [2019-02-28 10:49:31,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-02-28 10:49:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-02-28 10:49:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-02-28 10:49:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-28 10:49:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-28 10:49:32,048 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-02-28 10:49:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:32,048 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-28 10:49:32,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-28 10:49:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-28 10:49:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-28 10:49:32,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:32,050 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-02-28 10:49:32,050 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-02-28 10:49:32,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:32,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:32,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:34,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:34,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:34,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:34,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:34,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:34,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:34,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:34,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:34,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:34,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:34,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-28 10:49:34,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:34,366 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:34,366 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:34,376 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:34,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:36,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:41,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:41,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-02-28 10:49:41,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:41,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-28 10:49:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-28 10:49:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:49:41,047 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-02-28 10:49:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:45,360 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-02-28 10:49:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:49:45,360 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-02-28 10:49:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:45,361 INFO L225 Difference]: With dead ends: 330 [2019-02-28 10:49:45,361 INFO L226 Difference]: Without dead ends: 329 [2019-02-28 10:49:45,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-02-28 10:49:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-02-28 10:49:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-02-28 10:49:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-02-28 10:49:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-02-28 10:49:45,436 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-02-28 10:49:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:45,436 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-02-28 10:49:45,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-28 10:49:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-02-28 10:49:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-02-28 10:49:45,437 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:45,438 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-02-28 10:49:45,438 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-02-28 10:49:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:45,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:45,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:47,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:47,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:47,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:47,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:47,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:47,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:47,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:47,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:47,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 209 conjunts are in the unsatisfiable core [2019-02-28 10:49:47,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:47,754 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:47,754 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:47,766 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:47,766 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:50,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:54,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:54,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-02-28 10:49:54,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:54,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-28 10:49:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-28 10:49:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:49:54,866 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-02-28 10:49:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:58,944 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-28 10:49:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:49:58,944 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-02-28 10:49:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:58,946 INFO L225 Difference]: With dead ends: 335 [2019-02-28 10:49:58,946 INFO L226 Difference]: Without dead ends: 334 [2019-02-28 10:49:58,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-02-28 10:49:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-28 10:49:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-02-28 10:49:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-02-28 10:49:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-02-28 10:49:59,026 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-02-28 10:49:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:59,026 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-02-28 10:49:59,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-28 10:49:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-02-28 10:49:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-02-28 10:49:59,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:59,028 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-02-28 10:49:59,028 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-02-28 10:49:59,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:59,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:01,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:01,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:01,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:01,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:01,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:01,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:01,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:01,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:02,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-28 10:50:02,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:02,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-28 10:50:02,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:02,049 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:02,049 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:02,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:02,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:04,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:08,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:08,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-02-28 10:50:08,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:08,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-28 10:50:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-28 10:50:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:50:08,749 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-02-28 10:50:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:13,340 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-02-28 10:50:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:50:13,340 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-02-28 10:50:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:13,341 INFO L225 Difference]: With dead ends: 340 [2019-02-28 10:50:13,341 INFO L226 Difference]: Without dead ends: 339 [2019-02-28 10:50:13,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-02-28 10:50:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-02-28 10:50:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-02-28 10:50:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-02-28 10:50:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-02-28 10:50:13,437 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-02-28 10:50:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:13,437 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-02-28 10:50:13,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-28 10:50:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-02-28 10:50:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-02-28 10:50:13,438 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:13,439 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-02-28 10:50:13,439 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-02-28 10:50:13,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:13,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:13,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:13,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:13,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:15,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:15,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:15,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:15,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:15,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:15,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:15,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:50:15,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:50:16,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:50:16,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:16,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-28 10:50:16,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:16,178 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:16,178 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:16,188 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:16,188 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:18,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:23,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:23,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-02-28 10:50:23,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:23,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-28 10:50:23,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-28 10:50:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:50:23,456 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-02-28 10:50:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:28,019 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-02-28 10:50:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:50:28,019 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-02-28 10:50:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:28,020 INFO L225 Difference]: With dead ends: 345 [2019-02-28 10:50:28,020 INFO L226 Difference]: Without dead ends: 344 [2019-02-28 10:50:28,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-02-28 10:50:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-28 10:50:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-02-28 10:50:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-28 10:50:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-28 10:50:28,103 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-02-28 10:50:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:28,103 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-28 10:50:28,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-28 10:50:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-28 10:50:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-28 10:50:28,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:28,104 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-02-28 10:50:28,104 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:28,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-02-28 10:50:28,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:28,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:28,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:30,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:30,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:30,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:30,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:30,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:30,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:30,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:30,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:30,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 218 conjunts are in the unsatisfiable core [2019-02-28 10:50:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:30,986 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:30,986 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:30,994 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:30,994 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:33,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:38,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:38,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-02-28 10:50:38,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-28 10:50:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-28 10:50:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-02-28 10:50:38,054 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-02-28 10:50:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:42,846 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-02-28 10:50:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:50:42,846 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-02-28 10:50:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:42,847 INFO L225 Difference]: With dead ends: 350 [2019-02-28 10:50:42,847 INFO L226 Difference]: Without dead ends: 349 [2019-02-28 10:50:42,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-02-28 10:50:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-02-28 10:50:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-02-28 10:50:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-02-28 10:50:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-02-28 10:50:42,936 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-02-28 10:50:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:42,937 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-02-28 10:50:42,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-28 10:50:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-02-28 10:50:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-02-28 10:50:42,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:42,938 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-02-28 10:50:42,938 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-02-28 10:50:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:42,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:42,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:45,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:45,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:45,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:45,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:45,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:45,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:45,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:45,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:45,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-28 10:50:45,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:45,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-28 10:50:45,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:45,911 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:45,911 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:45,922 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:45,922 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:48,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:53,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:53,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-02-28 10:50:53,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:53,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-28 10:50:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-28 10:50:53,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:50:53,146 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-02-28 10:50:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:57,773 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-28 10:50:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:50:57,774 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-02-28 10:50:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:57,775 INFO L225 Difference]: With dead ends: 355 [2019-02-28 10:50:57,775 INFO L226 Difference]: Without dead ends: 354 [2019-02-28 10:50:57,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-02-28 10:50:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-28 10:50:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-02-28 10:50:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-02-28 10:50:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-02-28 10:50:57,862 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-02-28 10:50:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:57,862 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-02-28 10:50:57,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-28 10:50:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-02-28 10:50:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-02-28 10:50:57,863 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:57,863 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-02-28 10:50:57,864 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-02-28 10:50:57,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:57,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:57,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:00,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:00,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:00,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:00,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:00,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:00,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:51:00,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:51:00,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:51:00,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:00,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-28 10:51:00,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:00,521 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:00,522 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:00,608 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:00,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:03,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:08,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:08,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-02-28 10:51:08,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:08,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-28 10:51:08,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-28 10:51:08,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:51:08,320 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-02-28 10:51:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:13,202 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-02-28 10:51:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:51:13,202 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-02-28 10:51:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:13,204 INFO L225 Difference]: With dead ends: 360 [2019-02-28 10:51:13,204 INFO L226 Difference]: Without dead ends: 359 [2019-02-28 10:51:13,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-02-28 10:51:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-02-28 10:51:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-02-28 10:51:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-02-28 10:51:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-02-28 10:51:13,298 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-02-28 10:51:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:13,299 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-02-28 10:51:13,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-28 10:51:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-02-28 10:51:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-02-28 10:51:13,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:13,300 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-02-28 10:51:13,300 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-02-28 10:51:13,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:13,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:13,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:13,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:15,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:15,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:15,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:15,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:15,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:15,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:15,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:15,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 227 conjunts are in the unsatisfiable core [2019-02-28 10:51:15,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:16,002 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:16,002 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:16,010 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:16,010 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:19,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-02-28 10:51:23,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:23,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-28 10:51:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-28 10:51:23,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:51:23,561 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-02-28 10:51:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:28,596 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-02-28 10:51:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:51:28,597 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-02-28 10:51:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:28,598 INFO L225 Difference]: With dead ends: 365 [2019-02-28 10:51:28,598 INFO L226 Difference]: Without dead ends: 364 [2019-02-28 10:51:28,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-02-28 10:51:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-02-28 10:51:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-02-28 10:51:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-28 10:51:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-28 10:51:28,695 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-02-28 10:51:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:28,695 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-28 10:51:28,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-28 10:51:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-28 10:51:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-28 10:51:28,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:28,696 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-02-28 10:51:28,697 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-02-28 10:51:28,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:28,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:28,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:31,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:31,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:31,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:31,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:31,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:31,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:51:31,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:51:31,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-28 10:51:31,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:31,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-28 10:51:31,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:31,817 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:31,817 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:31,827 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:31,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:35,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:39,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:39,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-02-28 10:51:39,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:39,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-28 10:51:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-28 10:51:39,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-02-28 10:51:39,333 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-02-28 10:51:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:44,353 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-02-28 10:51:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:51:44,353 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-02-28 10:51:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:44,355 INFO L225 Difference]: With dead ends: 370 [2019-02-28 10:51:44,355 INFO L226 Difference]: Without dead ends: 369 [2019-02-28 10:51:44,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-02-28 10:51:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-02-28 10:51:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-02-28 10:51:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-28 10:51:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-02-28 10:51:44,457 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-02-28 10:51:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:44,457 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-02-28 10:51:44,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-28 10:51:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-02-28 10:51:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-02-28 10:51:44,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:44,458 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-02-28 10:51:44,459 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:44,459 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-02-28 10:51:44,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:44,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:44,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:44,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:47,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:47,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:47,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:47,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:47,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:47,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:47,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:51:47,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:51:47,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:51:47,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:47,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-28 10:51:47,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:47,374 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:47,374 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:47,385 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:47,385 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:50,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:55,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:55,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-02-28 10:51:55,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:55,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-28 10:51:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-28 10:51:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:51:55,010 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-02-28 10:52:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:00,264 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-28 10:52:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:52:00,264 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-02-28 10:52:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:00,266 INFO L225 Difference]: With dead ends: 375 [2019-02-28 10:52:00,266 INFO L226 Difference]: Without dead ends: 374 [2019-02-28 10:52:00,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-02-28 10:52:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-28 10:52:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-02-28 10:52:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-02-28 10:52:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-02-28 10:52:00,368 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-02-28 10:52:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:00,369 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-02-28 10:52:00,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-28 10:52:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-02-28 10:52:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-02-28 10:52:00,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:00,370 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-02-28 10:52:00,370 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-02-28 10:52:00,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:00,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:00,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:03,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:03,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:03,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:03,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:03,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:03,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:03,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:03,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 236 conjunts are in the unsatisfiable core [2019-02-28 10:52:03,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:03,623 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:03,623 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:03,633 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:03,633 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:06,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:11,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:11,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-02-28 10:52:11,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:11,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-28 10:52:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-28 10:52:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-02-28 10:52:11,349 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-02-28 10:52:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:16,659 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-02-28 10:52:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:52:16,660 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-02-28 10:52:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:16,661 INFO L225 Difference]: With dead ends: 380 [2019-02-28 10:52:16,661 INFO L226 Difference]: Without dead ends: 379 [2019-02-28 10:52:16,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-02-28 10:52:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-02-28 10:52:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-02-28 10:52:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-02-28 10:52:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-02-28 10:52:16,766 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-02-28 10:52:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:16,767 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-02-28 10:52:16,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-28 10:52:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-02-28 10:52:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-02-28 10:52:16,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:16,768 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-02-28 10:52:16,768 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-02-28 10:52:16,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:16,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:19,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:19,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:19,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:19,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:19,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:19,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:19,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:19,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:20,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-28 10:52:20,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:20,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-28 10:52:20,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:20,325 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:20,325 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:20,335 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:20,335 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:23,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:28,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:28,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-02-28 10:52:28,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:28,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-28 10:52:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-28 10:52:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:52:28,019 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-02-28 10:52:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:33,492 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-02-28 10:52:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:52:33,492 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-02-28 10:52:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:33,494 INFO L225 Difference]: With dead ends: 385 [2019-02-28 10:52:33,494 INFO L226 Difference]: Without dead ends: 384 [2019-02-28 10:52:33,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-02-28 10:52:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-02-28 10:52:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-02-28 10:52:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-28 10:52:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-28 10:52:33,603 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-02-28 10:52:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:33,604 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-28 10:52:33,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-28 10:52:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-28 10:52:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-28 10:52:33,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:33,605 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-02-28 10:52:33,605 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-02-28 10:52:33,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:33,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:33,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:36,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:36,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:36,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:36,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:36,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:36,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:52:36,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:52:36,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:52:36,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:36,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-28 10:52:36,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:36,668 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:36,668 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,678 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:40,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:44,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:44,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-02-28 10:52:44,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:44,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-28 10:52:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-28 10:52:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:52:44,840 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-02-28 10:52:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:50,384 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-02-28 10:52:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:52:50,384 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-02-28 10:52:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:50,385 INFO L225 Difference]: With dead ends: 390 [2019-02-28 10:52:50,385 INFO L226 Difference]: Without dead ends: 389 [2019-02-28 10:52:50,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-02-28 10:52:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-02-28 10:52:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-02-28 10:52:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-02-28 10:52:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-02-28 10:52:50,496 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-02-28 10:52:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:50,497 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-02-28 10:52:50,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-28 10:52:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-02-28 10:52:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-02-28 10:52:50,498 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:50,498 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-02-28 10:52:50,498 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-02-28 10:52:50,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:50,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:50,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:53,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:53,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:53,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:53,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:53,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:53,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:53,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:53,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 245 conjunts are in the unsatisfiable core [2019-02-28 10:52:53,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:53,629 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:53,629 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:53,641 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:53,641 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:57,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:01,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:01,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-02-28 10:53:01,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:01,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-28 10:53:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-28 10:53:01,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:53:01,756 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-02-28 10:53:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:07,501 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-28 10:53:07,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:53:07,501 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-02-28 10:53:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:07,503 INFO L225 Difference]: With dead ends: 395 [2019-02-28 10:53:07,503 INFO L226 Difference]: Without dead ends: 394 [2019-02-28 10:53:07,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-02-28 10:53:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-28 10:53:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-02-28 10:53:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-02-28 10:53:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-02-28 10:53:07,618 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-02-28 10:53:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:07,618 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-02-28 10:53:07,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-28 10:53:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-02-28 10:53:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-02-28 10:53:07,619 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:07,619 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-02-28 10:53:07,620 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:53:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-02-28 10:53:07,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:07,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:07,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:07,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:07,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:10,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:10,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:10,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:10,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:10,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:10,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:10,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:11,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-28 10:53:11,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:11,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-28 10:53:11,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:11,480 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:11,481 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,488 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,489 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:15,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:19,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:19,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-02-28 10:53:19,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:19,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-28 10:53:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-28 10:53:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-02-28 10:53:19,875 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-02-28 10:53:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:25,818 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-02-28 10:53:25,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:53:25,819 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-02-28 10:53:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:25,820 INFO L225 Difference]: With dead ends: 400 [2019-02-28 10:53:25,820 INFO L226 Difference]: Without dead ends: 399 [2019-02-28 10:53:25,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-02-28 10:53:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-02-28 10:53:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-02-28 10:53:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-28 10:53:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-02-28 10:53:25,937 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-02-28 10:53:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:25,937 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-02-28 10:53:25,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-28 10:53:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-02-28 10:53:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-02-28 10:53:25,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:25,939 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-02-28 10:53:25,939 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:53:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-02-28 10:53:25,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:25,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:25,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:25,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:25,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:28,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:28,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:28,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:28,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:28,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:28,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:28,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:28,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:29,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:29,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:29,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-28 10:53:29,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:29,157 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:29,157 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:29,167 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:29,167 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:33,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:37,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:37,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-02-28 10:53:37,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:37,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-28 10:53:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-28 10:53:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:53:37,506 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-02-28 10:53:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:43,278 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-02-28 10:53:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:53:43,278 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-02-28 10:53:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:43,280 INFO L225 Difference]: With dead ends: 405 [2019-02-28 10:53:43,280 INFO L226 Difference]: Without dead ends: 404 [2019-02-28 10:53:43,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-02-28 10:53:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-02-28 10:53:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-02-28 10:53:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-28 10:53:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-28 10:53:43,400 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-02-28 10:53:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:43,401 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-28 10:53:43,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-28 10:53:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-28 10:53:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-28 10:53:43,402 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:43,402 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-02-28 10:53:43,403 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:53:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-02-28 10:53:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:43,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:43,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:43,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:46,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:46,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:46,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:46,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:46,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:46,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:46,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:46,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:46,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 254 conjunts are in the unsatisfiable core [2019-02-28 10:53:46,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:46,973 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:46,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,983 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,983 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:50,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:55,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:55,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-02-28 10:53:55,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:55,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-28 10:53:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-28 10:53:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:53:55,170 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-02-28 10:54:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:01,575 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-02-28 10:54:01,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:54:01,575 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-02-28 10:54:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:01,578 INFO L225 Difference]: With dead ends: 410 [2019-02-28 10:54:01,578 INFO L226 Difference]: Without dead ends: 409 [2019-02-28 10:54:01,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-02-28 10:54:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-02-28 10:54:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-02-28 10:54:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-02-28 10:54:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-02-28 10:54:01,710 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-02-28 10:54:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:01,711 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-02-28 10:54:01,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-28 10:54:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-02-28 10:54:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-02-28 10:54:01,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:01,713 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-02-28 10:54:01,713 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:54:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-02-28 10:54:01,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:01,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:01,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:05,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:05,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:05,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:05,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:05,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:05,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:54:05,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:54:05,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:54:06,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-28 10:54:06,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:54:06,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1714 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-28 10:54:06,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:06,206 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:06,206 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:06,215 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:06,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:10,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:15,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:15,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-02-28 10:54:15,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:15,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-28 10:54:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-28 10:54:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:54:15,174 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-02-28 10:54:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:21,776 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-02-28 10:54:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:54:21,776 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-02-28 10:54:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:21,778 INFO L225 Difference]: With dead ends: 415 [2019-02-28 10:54:21,778 INFO L226 Difference]: Without dead ends: 414 [2019-02-28 10:54:21,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-02-28 10:54:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-02-28 10:54:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-02-28 10:54:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-02-28 10:54:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-02-28 10:54:21,908 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-02-28 10:54:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:21,908 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-02-28 10:54:21,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-28 10:54:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-02-28 10:54:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-02-28 10:54:21,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:21,910 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-02-28 10:54:21,910 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:54:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-02-28 10:54:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:21,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:54:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:21,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:25,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:25,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:25,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:25,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:25,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:25,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:54:25,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:54:25,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:54:25,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:54:25,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:54:25,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-28 10:54:25,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:25,400 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:25,400 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:25,408 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:25,409 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:29,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:34,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:34,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-02-28 10:54:34,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:34,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-28 10:54:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-28 10:54:34,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:54:34,282 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-02-28 10:54:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:40,800 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-02-28 10:54:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:54:40,800 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-02-28 10:54:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:40,802 INFO L225 Difference]: With dead ends: 420 [2019-02-28 10:54:40,802 INFO L226 Difference]: Without dead ends: 419 [2019-02-28 10:54:40,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-02-28 10:54:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-02-28 10:54:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-02-28 10:54:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-02-28 10:54:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-02-28 10:54:40,932 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-02-28 10:54:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:40,932 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-02-28 10:54:40,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-28 10:54:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-02-28 10:54:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-02-28 10:54:40,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:40,934 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-02-28 10:54:40,934 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:54:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-02-28 10:54:40,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:40,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:54:40,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:40,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:44,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:44,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:44,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:44,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:44,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:44,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:54:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:44,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:44,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 263 conjunts are in the unsatisfiable core [2019-02-28 10:54:44,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:44,692 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:44,692 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:44,700 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:44,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:48,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:53,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:53,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-02-28 10:54:53,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:53,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-28 10:54:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-28 10:54:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:54:53,331 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-02-28 10:54:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:59,982 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-02-28 10:54:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:54:59,982 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-02-28 10:54:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:59,984 INFO L225 Difference]: With dead ends: 425 [2019-02-28 10:54:59,984 INFO L226 Difference]: Without dead ends: 424 [2019-02-28 10:54:59,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-02-28 10:54:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-28 10:55:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-02-28 10:55:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-02-28 10:55:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-02-28 10:55:00,112 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-02-28 10:55:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:00,113 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-02-28 10:55:00,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-28 10:55:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-02-28 10:55:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-02-28 10:55:00,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:00,115 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-02-28 10:55:00,115 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:55:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-02-28 10:55:00,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:00,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:55:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:00,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:03,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:03,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:03,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:55:03,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:55:03,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:03,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:55:03,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:55:03,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:55:04,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-28 10:55:04,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:55:04,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-28 10:55:04,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:55:04,570 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:55:04,570 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:55:04,580 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:55:04,580 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:55:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:08,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:55:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:13,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:55:13,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-02-28 10:55:13,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:55:13,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-28 10:55:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-28 10:55:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-02-28 10:55:13,367 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-02-28 10:55:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:20,132 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-02-28 10:55:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:55:20,132 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-02-28 10:55:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:20,134 INFO L225 Difference]: With dead ends: 430 [2019-02-28 10:55:20,135 INFO L226 Difference]: Without dead ends: 429 [2019-02-28 10:55:20,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-02-28 10:55:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-02-28 10:55:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-02-28 10:55:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-02-28 10:55:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-02-28 10:55:20,275 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-02-28 10:55:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:20,275 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-02-28 10:55:20,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-28 10:55:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-02-28 10:55:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-02-28 10:55:20,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:20,278 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-02-28 10:55:20,278 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:55:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-02-28 10:55:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:20,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:55:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:20,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:24,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:24,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:24,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:55:24,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:55:24,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:24,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:55:24,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:55:24,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:55:24,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:55:24,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:55:24,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-28 10:55:24,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:55:24,471 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:55:24,471 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:55:24,485 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:55:24,486 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:55:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:29,161 INFO L322 TraceCheckSpWp]: Computing backward predicates...