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-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:17:03,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:17:03,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:17:03,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:17:03,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:17:03,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:17:03,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:17:03,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:17:03,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:17:03,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:17:03,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:17:03,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:17:03,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:17:03,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:17:03,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:17:03,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:17:03,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:17:03,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:17:03,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:17:03,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:17:03,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:17:03,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:17:03,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:17:03,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:17:03,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:17:03,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:17:03,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:17:03,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:17:03,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:17:03,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:17:03,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:17:03,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:17:03,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:17:03,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:17:03,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:17:03,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:17:03,911 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:17:03,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:17:03,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:17:03,926 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:17:03,926 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:17:03,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:17:03,927 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:17:03,927 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:17:03,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:17:03,927 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:17:03,928 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:17:03,928 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:17:03,928 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:17:03,928 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:17:03,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:17:03,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:17:03,929 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:17:03,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:17:03,930 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:17:03,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:17:03,930 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:17:03,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:17:03,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:17:03,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:17:03,931 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:17:03,931 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:17:03,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:17:03,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:17:03,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:17:03,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:17:03,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:17:03,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:17:03,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:17:03,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:17:03,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:17:03,934 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:17:03,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:17:03,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:17:03,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:17:03,934 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:17:03,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:17:04,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:17:04,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:17:04,010 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:17:04,011 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:17:04,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-12-24 14:17:04,012 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-12-24 14:17:04,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:17:04,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:17:04,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:17:04,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:17:04,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:17:04,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,122 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-24 14:17:04,123 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-24 14:17:04,123 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-24 14:17:04,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:17:04,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:17:04,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:17:04,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:17:04,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... [2018-12-24 14:17:04,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:17:04,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:17:04,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:17:04,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:17:04,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:17:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-24 14:17:04,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-24 14:17:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-24 14:17:04,526 INFO L272 CfgBuilder]: Using library mode [2018-12-24 14:17:04,526 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-24 14:17:04,527 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:17:04 BoogieIcfgContainer [2018-12-24 14:17:04,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:17:04,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:17:04,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:17:04,543 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:17:04,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:17:04" (1/2) ... [2018-12-24 14:17:04,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781c479c and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:17:04, skipping insertion in model container [2018-12-24 14:17:04,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:17:04" (2/2) ... [2018-12-24 14:17:04,550 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-12-24 14:17:04,576 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:17:04,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:17:04,643 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:17:04,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:17:04,714 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:17:04,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:17:04,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:17:04,715 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:17:04,715 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:17:04,715 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:17:04,715 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:17:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-24 14:17:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:17:04,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:04,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:17:04,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-12-24 14:17:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:04,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:04,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:04,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:17:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 14:17:04,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:17:04,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:17:04,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:17:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:17:04,999 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-12-24 14:17:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:05,098 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-24 14:17:05,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:17:05,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 14:17:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:05,114 INFO L225 Difference]: With dead ends: 17 [2018-12-24 14:17:05,114 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 14:17:05,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:17:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 14:17:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-24 14:17:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 14:17:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-24 14:17:05,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-12-24 14:17:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:05,155 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-24 14:17:05,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:17:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-24 14:17:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:17:05,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:05,156 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-24 14:17:05,156 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-12-24 14:17:05,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:05,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:05,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:05,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:05,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:05,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:05,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:05,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 14:17:05,270 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2018-12-24 14:17:05,337 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:17:05,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:17:30,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:17:30,802 INFO L272 AbstractInterpreter]: Visited 6 different actions 71 times. Merged at 5 different actions 65 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:17:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:30,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:17:30,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:30,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:30,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:30,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:30,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:30,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:30,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:30,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:30,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:31,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 14:17:31,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:31,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:17:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:17:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:17:31,309 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-12-24 14:17:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:31,417 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-24 14:17:31,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:17:31,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-24 14:17:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:31,418 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:17:31,418 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 14:17:31,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:17:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 14:17:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 14:17:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:17:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-24 14:17:31,424 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-12-24 14:17:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:31,424 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-24 14:17:31,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:17:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-24 14:17:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 14:17:31,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:31,425 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-12-24 14:17:31,426 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-12-24 14:17:31,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:31,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:31,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:31,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:31,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:31,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:31,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:31,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:31,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:31,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:31,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:31,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:17:31,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:31,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:31,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:31,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:31,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:31,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:31,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:32,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:32,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:17:32,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:32,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:17:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:17:32,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:17:32,019 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-12-24 14:17:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:32,163 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-24 14:17:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:17:32,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-24 14:17:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:32,164 INFO L225 Difference]: With dead ends: 19 [2018-12-24 14:17:32,165 INFO L226 Difference]: Without dead ends: 18 [2018-12-24 14:17:32,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:17:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-24 14:17:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-24 14:17:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 14:17:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-24 14:17:32,169 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-12-24 14:17:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:32,169 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-24 14:17:32,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:17:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-24 14:17:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 14:17:32,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:32,170 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-12-24 14:17:32,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:32,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-12-24 14:17:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:32,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:32,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:32,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:32,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:32,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:32,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:32,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:32,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:32,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:32,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:32,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:32,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:32,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:32,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:32,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:32,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:32,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:32,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:32,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:32,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:32,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:17:32,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:32,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:17:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:17:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:17:32,558 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-12-24 14:17:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:32,930 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-24 14:17:32,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:17:32,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-24 14:17:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:32,931 INFO L225 Difference]: With dead ends: 23 [2018-12-24 14:17:32,932 INFO L226 Difference]: Without dead ends: 22 [2018-12-24 14:17:32,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:17:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-24 14:17:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-24 14:17:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 14:17:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-24 14:17:32,937 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-12-24 14:17:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:32,937 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-24 14:17:32,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:17:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-24 14:17:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 14:17:32,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:32,938 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-12-24 14:17:32,938 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-12-24 14:17:32,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:32,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:32,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:32,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:32,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:33,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:33,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:33,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:33,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:33,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:33,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:33,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:33,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:33,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:33,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:33,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:33,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:33,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:33,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:33,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:33,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 14:17:33,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:33,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:17:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:17:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:17:33,365 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-12-24 14:17:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:33,419 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-24 14:17:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:17:33,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-12-24 14:17:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:33,420 INFO L225 Difference]: With dead ends: 27 [2018-12-24 14:17:33,420 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 14:17:33,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:17:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 14:17:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-24 14:17:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 14:17:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-24 14:17:33,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-12-24 14:17:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:33,426 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-24 14:17:33,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:17:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-24 14:17:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 14:17:33,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:33,427 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-12-24 14:17:33,428 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-12-24 14:17:33,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:33,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:33,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:33,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:33,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:33,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:33,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:33,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:33,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:33,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:33,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:33,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:33,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:33,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-24 14:17:33,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:33,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:33,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:33,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:33,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:33,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:33,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:33,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:33,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 14:17:33,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:33,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:17:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:17:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:17:33,897 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-12-24 14:17:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:33,955 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-24 14:17:33,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:17:33,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-24 14:17:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:33,957 INFO L225 Difference]: With dead ends: 31 [2018-12-24 14:17:33,957 INFO L226 Difference]: Without dead ends: 30 [2018-12-24 14:17:33,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:17:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-24 14:17:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-24 14:17:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 14:17:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-24 14:17:33,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-12-24 14:17:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:33,964 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-24 14:17:33,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:17:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-24 14:17:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 14:17:33,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:33,966 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-12-24 14:17:33,966 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:33,966 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-12-24 14:17:33,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:33,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:33,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:33,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:33,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:34,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:34,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:34,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:34,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:34,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:34,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:34,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:34,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:34,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:34,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:34,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:34,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:34,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:34,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:34,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:34,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:34,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:34,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-24 14:17:34,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:34,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 14:17:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 14:17:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:17:34,398 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-12-24 14:17:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:34,502 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-24 14:17:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:17:34,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-12-24 14:17:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:34,504 INFO L225 Difference]: With dead ends: 35 [2018-12-24 14:17:34,504 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 14:17:34,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:17:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 14:17:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-24 14:17:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 14:17:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-24 14:17:34,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-12-24 14:17:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:34,509 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-24 14:17:34,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 14:17:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-24 14:17:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 14:17:34,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:34,511 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-12-24 14:17:34,511 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:34,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:34,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-12-24 14:17:34,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:34,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:34,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:34,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:34,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:34,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:34,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:34,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:34,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:34,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:34,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:34,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:34,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:34,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:34,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:34,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:34,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:34,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-24 14:17:34,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:34,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 14:17:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 14:17:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:17:34,977 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-12-24 14:17:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:35,179 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-24 14:17:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:17:35,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-12-24 14:17:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:35,182 INFO L225 Difference]: With dead ends: 39 [2018-12-24 14:17:35,182 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 14:17:35,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:17:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 14:17:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-24 14:17:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 14:17:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-24 14:17:35,188 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-12-24 14:17:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:35,189 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-24 14:17:35,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 14:17:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-24 14:17:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 14:17:35,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:35,190 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-12-24 14:17:35,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-12-24 14:17:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:35,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:35,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:35,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:35,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:35,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:35,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:35,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:35,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:35,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:35,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-24 14:17:35,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:35,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:35,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:35,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:35,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:35,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:35,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:35,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:35,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-24 14:17:35,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:35,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 14:17:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 14:17:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 14:17:35,932 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-12-24 14:17:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:36,038 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-24 14:17:36,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 14:17:36,038 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-24 14:17:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:36,040 INFO L225 Difference]: With dead ends: 43 [2018-12-24 14:17:36,040 INFO L226 Difference]: Without dead ends: 42 [2018-12-24 14:17:36,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 14:17:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-24 14:17:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-24 14:17:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 14:17:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-24 14:17:36,046 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-12-24 14:17:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:36,047 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-24 14:17:36,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 14:17:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-24 14:17:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 14:17:36,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:36,048 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-12-24 14:17:36,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-12-24 14:17:36,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:36,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:36,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:36,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:36,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:36,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:36,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:36,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:36,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:36,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:36,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:36,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:36,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:36,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:36,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:36,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:36,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:36,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:36,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:37,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-24 14:17:37,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:37,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 14:17:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 14:17:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:17:37,083 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-12-24 14:17:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:37,178 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-24 14:17:37,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:17:37,179 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-12-24 14:17:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:37,180 INFO L225 Difference]: With dead ends: 47 [2018-12-24 14:17:37,180 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 14:17:37,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:17:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 14:17:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-24 14:17:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 14:17:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-24 14:17:37,187 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-12-24 14:17:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:37,187 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-24 14:17:37,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 14:17:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-24 14:17:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 14:17:37,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:37,188 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-12-24 14:17:37,188 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-12-24 14:17:37,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:37,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:37,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:37,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:37,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:37,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:37,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:37,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:37,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:37,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:37,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:37,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:37,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:37,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:37,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:37,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:37,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:37,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:37,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-24 14:17:37,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:37,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 14:17:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 14:17:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 14:17:37,861 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-12-24 14:17:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:37,961 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-24 14:17:37,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 14:17:37,962 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-12-24 14:17:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:37,963 INFO L225 Difference]: With dead ends: 51 [2018-12-24 14:17:37,963 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 14:17:37,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 14:17:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 14:17:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-24 14:17:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 14:17:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-24 14:17:37,969 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-12-24 14:17:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:37,969 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-24 14:17:37,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 14:17:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-24 14:17:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 14:17:37,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:37,971 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-12-24 14:17:37,971 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-12-24 14:17:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:37,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:38,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:38,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:38,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:38,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:38,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:38,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:38,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:38,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-24 14:17:38,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:38,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:38,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:38,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:38,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:38,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:38,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:39,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:39,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-24 14:17:39,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:39,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 14:17:39,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 14:17:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:17:39,054 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-12-24 14:17:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:39,146 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-24 14:17:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 14:17:39,146 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-12-24 14:17:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:39,147 INFO L225 Difference]: With dead ends: 55 [2018-12-24 14:17:39,147 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 14:17:39,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:17:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 14:17:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-24 14:17:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 14:17:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-24 14:17:39,154 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-12-24 14:17:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:39,155 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-24 14:17:39,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 14:17:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-24 14:17:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 14:17:39,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:39,156 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-12-24 14:17:39,156 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-12-24 14:17:39,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:39,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:39,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:39,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:39,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:39,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:39,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:39,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:39,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:39,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:39,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:39,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:39,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:39,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:39,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:39,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:39,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:39,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:39,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:39,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:39,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:40,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:40,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-24 14:17:40,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:40,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 14:17:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 14:17:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 14:17:40,145 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-12-24 14:17:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:40,240 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-24 14:17:40,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 14:17:40,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-12-24 14:17:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:40,241 INFO L225 Difference]: With dead ends: 59 [2018-12-24 14:17:40,242 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 14:17:40,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 14:17:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 14:17:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-24 14:17:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 14:17:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-24 14:17:40,249 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-12-24 14:17:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:40,249 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-24 14:17:40,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 14:17:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-24 14:17:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 14:17:40,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:40,251 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-12-24 14:17:40,251 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-12-24 14:17:40,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:40,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:40,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:41,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:41,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:41,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:41,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:41,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:41,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:41,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:41,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:41,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:41,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:41,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:41,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:42,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-24 14:17:42,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:42,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 14:17:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 14:17:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:17:42,469 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-12-24 14:17:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:42,719 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-24 14:17:42,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 14:17:42,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-12-24 14:17:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:42,721 INFO L225 Difference]: With dead ends: 63 [2018-12-24 14:17:42,721 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 14:17:42,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:17:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 14:17:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-24 14:17:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:17:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 14:17:42,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-12-24 14:17:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:42,727 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 14:17:42,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 14:17:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 14:17:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 14:17:42,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:42,729 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-12-24 14:17:42,729 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-12-24 14:17:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:42,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:42,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:42,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:42,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:42,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:42,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:42,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:42,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:42,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:42,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:42,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-24 14:17:42,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:42,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:43,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:43,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:43,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:43,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:43,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:43,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:43,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-24 14:17:43,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:43,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 14:17:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 14:17:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 14:17:43,768 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-12-24 14:17:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:43,975 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-24 14:17:43,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 14:17:43,976 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-12-24 14:17:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:43,977 INFO L225 Difference]: With dead ends: 67 [2018-12-24 14:17:43,977 INFO L226 Difference]: Without dead ends: 66 [2018-12-24 14:17:43,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 14:17:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-24 14:17:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-24 14:17:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 14:17:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-24 14:17:43,985 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-12-24 14:17:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:43,985 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-24 14:17:43,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 14:17:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-24 14:17:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 14:17:43,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:43,991 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-12-24 14:17:43,991 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:43,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-12-24 14:17:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:43,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:43,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:44,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:44,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:44,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:44,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:44,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:44,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:44,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:44,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:44,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:44,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:44,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:44,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:44,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:44,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:44,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:44,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:45,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:45,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-24 14:17:45,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:45,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 14:17:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 14:17:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:17:45,076 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-12-24 14:17:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:45,192 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-24 14:17:45,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 14:17:45,193 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-12-24 14:17:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:45,194 INFO L225 Difference]: With dead ends: 71 [2018-12-24 14:17:45,194 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 14:17:45,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:17:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 14:17:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-12-24 14:17:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 14:17:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-24 14:17:45,201 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-12-24 14:17:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:45,201 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-24 14:17:45,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 14:17:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-24 14:17:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 14:17:45,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:45,203 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-12-24 14:17:45,203 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-12-24 14:17:45,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:45,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:45,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:45,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:45,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:45,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:45,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:45,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:45,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:45,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:45,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:45,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:45,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:45,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:45,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:45,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:47,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:48,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:48,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-24 14:17:48,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:48,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 14:17:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 14:17:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 14:17:48,038 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-12-24 14:17:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:48,169 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 14:17:48,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 14:17:48,169 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-12-24 14:17:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:48,170 INFO L225 Difference]: With dead ends: 75 [2018-12-24 14:17:48,170 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 14:17:48,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 14:17:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 14:17:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-24 14:17:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 14:17:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-24 14:17:48,178 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-12-24 14:17:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:48,178 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-24 14:17:48,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 14:17:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-24 14:17:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 14:17:48,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:48,179 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-12-24 14:17:48,180 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:48,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-12-24 14:17:48,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:48,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:48,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:48,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:48,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:48,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:48,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:48,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:48,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:48,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:48,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:48,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-24 14:17:48,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:48,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:48,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:48,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:48,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:48,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:48,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:49,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:49,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-24 14:17:49,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:49,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 14:17:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 14:17:49,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:17:49,633 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-12-24 14:17:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:49,740 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-24 14:17:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 14:17:49,740 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-12-24 14:17:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:49,741 INFO L225 Difference]: With dead ends: 79 [2018-12-24 14:17:49,741 INFO L226 Difference]: Without dead ends: 78 [2018-12-24 14:17:49,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:17:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-24 14:17:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-24 14:17:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 14:17:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-24 14:17:49,747 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-12-24 14:17:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:49,748 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-24 14:17:49,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 14:17:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-24 14:17:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 14:17:49,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:49,749 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-12-24 14:17:49,749 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-12-24 14:17:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:49,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:49,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:50,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:50,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:50,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:50,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:50,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:50,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:50,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:50,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:50,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:50,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:50,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:50,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:50,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:50,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:50,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:50,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:51,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:51,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-24 14:17:51,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:51,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 14:17:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 14:17:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 14:17:51,109 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-12-24 14:17:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:51,247 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-24 14:17:51,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 14:17:51,247 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-12-24 14:17:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:51,248 INFO L225 Difference]: With dead ends: 83 [2018-12-24 14:17:51,248 INFO L226 Difference]: Without dead ends: 82 [2018-12-24 14:17:51,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 14:17:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-24 14:17:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-24 14:17:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 14:17:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-24 14:17:51,253 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-12-24 14:17:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:51,254 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-24 14:17:51,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 14:17:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-24 14:17:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 14:17:51,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:51,255 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-12-24 14:17:51,255 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:51,255 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-12-24 14:17:51,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:51,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:51,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:51,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:51,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:51,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:51,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:51,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:51,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:51,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:51,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:51,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:51,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:51,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:51,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:52,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:52,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:52,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-24 14:17:52,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:52,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 14:17:52,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 14:17:52,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:17:52,812 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-12-24 14:17:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:52,972 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-24 14:17:52,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 14:17:52,973 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-12-24 14:17:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:52,974 INFO L225 Difference]: With dead ends: 87 [2018-12-24 14:17:52,974 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 14:17:52,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:17:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 14:17:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-12-24 14:17:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 14:17:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-24 14:17:52,980 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-12-24 14:17:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:52,980 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-24 14:17:52,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 14:17:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-24 14:17:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 14:17:52,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:52,981 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-12-24 14:17:52,981 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-12-24 14:17:52,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:52,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:53,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:53,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:53,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:53,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:53,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:53,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:53,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:53,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-24 14:17:53,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:53,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:53,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:53,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:53,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:53,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:53,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:54,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-24 14:17:54,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:54,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 14:17:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 14:17:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 14:17:54,620 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-12-24 14:17:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:54,780 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-24 14:17:54,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 14:17:54,780 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-12-24 14:17:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:54,782 INFO L225 Difference]: With dead ends: 91 [2018-12-24 14:17:54,782 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 14:17:54,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 14:17:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 14:17:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-24 14:17:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 14:17:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-24 14:17:54,788 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-12-24 14:17:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:54,788 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-24 14:17:54,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 14:17:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-24 14:17:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 14:17:54,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:54,789 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-12-24 14:17:54,789 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-12-24 14:17:54,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:54,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:54,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:55,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:55,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:55,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:55,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:55,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:55,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:55,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:55,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:55,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:55,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:55,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:55,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:55,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:55,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:55,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:55,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:56,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:56,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-24 14:17:56,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:56,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 14:17:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 14:17:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:17:56,699 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-12-24 14:17:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:56,863 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-24 14:17:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 14:17:56,866 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-12-24 14:17:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:56,867 INFO L225 Difference]: With dead ends: 95 [2018-12-24 14:17:56,867 INFO L226 Difference]: Without dead ends: 94 [2018-12-24 14:17:56,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:17:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-24 14:17:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-12-24 14:17:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 14:17:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-24 14:17:56,871 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-12-24 14:17:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:56,871 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-24 14:17:56,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 14:17:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-24 14:17:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 14:17:56,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:56,872 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-12-24 14:17:56,872 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-12-24 14:17:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:56,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:56,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:57,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:57,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:57,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:57,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:57,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:57,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:57,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:57,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:57,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:57,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:57,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:57,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:57,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:17:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:57,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:58,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:58,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-24 14:17:58,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:58,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 14:17:58,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 14:17:58,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 14:17:58,947 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-12-24 14:17:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:59,096 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-24 14:17:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 14:17:59,100 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-12-24 14:17:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:59,101 INFO L225 Difference]: With dead ends: 99 [2018-12-24 14:17:59,101 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 14:17:59,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 14:17:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 14:17:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-24 14:17:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 14:17:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-24 14:17:59,105 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-12-24 14:17:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:59,105 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-24 14:17:59,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 14:17:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-24 14:17:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 14:17:59,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:59,106 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-12-24 14:17:59,106 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:59,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:59,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-12-24 14:17:59,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:59,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:59,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:59,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:59,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:17:59,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:59,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:59,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:59,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:59,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:59,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:59,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:59,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-24 14:17:59,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:59,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:59,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:17:59,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:17:59,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:17:59,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:00,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:01,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:01,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-24 14:18:01,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:01,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 14:18:01,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 14:18:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:18:01,031 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-12-24 14:18:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:01,229 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-24 14:18:01,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 14:18:01,230 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-12-24 14:18:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:01,231 INFO L225 Difference]: With dead ends: 103 [2018-12-24 14:18:01,231 INFO L226 Difference]: Without dead ends: 102 [2018-12-24 14:18:01,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:18:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-24 14:18:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-12-24 14:18:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 14:18:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-24 14:18:01,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-12-24 14:18:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:01,238 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-24 14:18:01,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 14:18:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-24 14:18:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 14:18:01,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:01,239 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-12-24 14:18:01,239 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-12-24 14:18:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:01,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:01,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:01,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:01,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:01,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:01,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:01,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:01,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:01,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:01,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:01,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:01,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:01,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:01,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:01,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:01,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:02,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:03,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:03,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-24 14:18:03,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:03,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 14:18:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 14:18:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 14:18:03,332 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-12-24 14:18:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:03,527 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-24 14:18:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 14:18:03,527 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-12-24 14:18:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:03,528 INFO L225 Difference]: With dead ends: 107 [2018-12-24 14:18:03,528 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 14:18:03,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 14:18:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 14:18:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-24 14:18:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 14:18:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-24 14:18:03,534 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-12-24 14:18:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:03,535 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-24 14:18:03,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 14:18:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-24 14:18:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 14:18:03,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:03,536 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-12-24 14:18:03,536 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-12-24 14:18:03,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:03,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:03,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:03,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:03,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:04,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:04,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:04,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:04,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:04,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:04,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:04,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:04,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:04,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:04,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:04,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:04,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:04,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:04,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:05,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:05,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-24 14:18:05,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:05,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 14:18:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 14:18:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:18:05,557 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-12-24 14:18:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:05,761 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-24 14:18:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 14:18:05,762 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-12-24 14:18:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:05,763 INFO L225 Difference]: With dead ends: 111 [2018-12-24 14:18:05,763 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 14:18:05,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:18:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 14:18:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-12-24 14:18:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 14:18:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-24 14:18:05,769 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-12-24 14:18:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:05,769 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-24 14:18:05,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 14:18:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-24 14:18:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 14:18:05,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:05,770 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-12-24 14:18:05,770 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-12-24 14:18:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:05,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:05,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:06,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:06,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:06,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:06,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:06,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:06,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:06,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:06,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-24 14:18:06,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:06,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:06,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:06,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:06,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:06,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:06,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:07,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-24 14:18:07,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:07,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 14:18:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 14:18:07,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 14:18:07,876 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-12-24 14:18:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:08,111 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-24 14:18:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 14:18:08,111 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-12-24 14:18:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:08,112 INFO L225 Difference]: With dead ends: 115 [2018-12-24 14:18:08,112 INFO L226 Difference]: Without dead ends: 114 [2018-12-24 14:18:08,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 14:18:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-24 14:18:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-12-24 14:18:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 14:18:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-24 14:18:08,118 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-12-24 14:18:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:08,118 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-24 14:18:08,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 14:18:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-24 14:18:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 14:18:08,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:08,119 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-12-24 14:18:08,119 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-12-24 14:18:08,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:08,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:08,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:08,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:08,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:08,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:08,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:08,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:08,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:08,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:08,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:08,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:08,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:08,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:08,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:08,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:08,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:08,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:08,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:08,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:09,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:10,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:10,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-24 14:18:10,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:10,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 14:18:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 14:18:10,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:18:10,435 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-12-24 14:18:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:10,626 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-24 14:18:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 14:18:10,627 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-12-24 14:18:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:10,628 INFO L225 Difference]: With dead ends: 119 [2018-12-24 14:18:10,628 INFO L226 Difference]: Without dead ends: 118 [2018-12-24 14:18:10,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:18:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-24 14:18:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-12-24 14:18:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-24 14:18:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-12-24 14:18:10,633 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-12-24 14:18:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:10,633 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-12-24 14:18:10,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 14:18:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-12-24 14:18:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-24 14:18:10,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:10,634 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-12-24 14:18:10,634 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-12-24 14:18:10,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:10,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:10,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:10,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:10,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:11,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:11,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:11,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:11,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:11,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:11,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:11,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:11,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:11,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:11,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:11,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:11,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:12,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-24 14:18:13,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:13,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 14:18:13,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 14:18:13,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 14:18:13,490 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-12-24 14:18:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:13,695 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-24 14:18:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 14:18:13,695 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-12-24 14:18:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:13,697 INFO L225 Difference]: With dead ends: 123 [2018-12-24 14:18:13,697 INFO L226 Difference]: Without dead ends: 122 [2018-12-24 14:18:13,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 14:18:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-24 14:18:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-24 14:18:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 14:18:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-12-24 14:18:13,702 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-12-24 14:18:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:13,703 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-12-24 14:18:13,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 14:18:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-12-24 14:18:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 14:18:13,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:13,704 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-12-24 14:18:13,704 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-12-24 14:18:13,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:13,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:14,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:14,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:14,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:14,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:14,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:14,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:14,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:14,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:14,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-24 14:18:14,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:14,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:14,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:14,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:14,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:14,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:15,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:16,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:16,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-24 14:18:16,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:16,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 14:18:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 14:18:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:18:16,215 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-12-24 14:18:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:16,408 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-24 14:18:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 14:18:16,408 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-12-24 14:18:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:16,409 INFO L225 Difference]: With dead ends: 127 [2018-12-24 14:18:16,410 INFO L226 Difference]: Without dead ends: 126 [2018-12-24 14:18:16,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:18:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-24 14:18:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-12-24 14:18:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-24 14:18:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-12-24 14:18:16,415 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-12-24 14:18:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:16,416 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-12-24 14:18:16,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 14:18:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-12-24 14:18:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-24 14:18:16,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:16,416 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-12-24 14:18:16,416 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:16,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-12-24 14:18:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:16,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:16,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:17,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:17,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:17,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:17,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:17,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:17,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:17,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:17,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:17,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:17,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:17,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:17,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:17,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:17,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:18,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:19,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:19,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-24 14:18:19,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:19,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 14:18:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 14:18:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 14:18:19,710 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-12-24 14:18:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:19,941 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-24 14:18:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 14:18:19,941 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-12-24 14:18:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:19,943 INFO L225 Difference]: With dead ends: 131 [2018-12-24 14:18:19,943 INFO L226 Difference]: Without dead ends: 130 [2018-12-24 14:18:19,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 14:18:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-24 14:18:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-24 14:18:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-24 14:18:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-12-24 14:18:19,949 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-12-24 14:18:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:19,950 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-12-24 14:18:19,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 14:18:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-12-24 14:18:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-24 14:18:19,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:19,951 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-12-24 14:18:19,951 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-12-24 14:18:19,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:19,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:19,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:20,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:20,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:20,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:20,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:20,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:20,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:20,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:20,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:20,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:20,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:20,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:20,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:20,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:21,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:22,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:22,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-24 14:18:22,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:22,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 14:18:22,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 14:18:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:18:22,996 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-12-24 14:18:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:23,204 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-24 14:18:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 14:18:23,205 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-12-24 14:18:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:23,206 INFO L225 Difference]: With dead ends: 135 [2018-12-24 14:18:23,206 INFO L226 Difference]: Without dead ends: 134 [2018-12-24 14:18:23,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:18:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-24 14:18:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-24 14:18:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 14:18:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-24 14:18:23,212 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-12-24 14:18:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:23,213 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-24 14:18:23,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 14:18:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-24 14:18:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-24 14:18:23,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:23,214 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-12-24 14:18:23,215 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-12-24 14:18:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:23,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:24,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:24,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:24,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:24,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:24,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:24,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:24,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:25,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-24 14:18:25,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:25,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:25,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:25,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:25,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:25,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:26,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:27,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:27,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-24 14:18:27,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:27,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 14:18:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 14:18:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 14:18:27,491 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-12-24 14:18:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:27,724 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-24 14:18:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 14:18:27,725 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-12-24 14:18:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:27,726 INFO L225 Difference]: With dead ends: 139 [2018-12-24 14:18:27,727 INFO L226 Difference]: Without dead ends: 138 [2018-12-24 14:18:27,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 14:18:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-24 14:18:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-24 14:18:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 14:18:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-12-24 14:18:27,732 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-12-24 14:18:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:27,733 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-12-24 14:18:27,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 14:18:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-12-24 14:18:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-24 14:18:27,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:27,734 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-12-24 14:18:27,734 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-12-24 14:18:27,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:27,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:27,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:28,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:28,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:28,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:28,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:28,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:28,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:28,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:28,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:28,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:28,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:28,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:28,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:28,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:28,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:31,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:32,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-24 14:18:32,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 14:18:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 14:18:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:18:32,774 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-12-24 14:18:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:33,098 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-24 14:18:33,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 14:18:33,098 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-12-24 14:18:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:33,100 INFO L225 Difference]: With dead ends: 143 [2018-12-24 14:18:33,100 INFO L226 Difference]: Without dead ends: 142 [2018-12-24 14:18:33,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:18:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-24 14:18:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-12-24 14:18:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-24 14:18:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-12-24 14:18:33,105 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-12-24 14:18:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:33,106 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-12-24 14:18:33,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 14:18:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-12-24 14:18:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-24 14:18:33,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:33,107 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-12-24 14:18:33,107 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-12-24 14:18:33,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:33,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:33,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:33,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:33,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:34,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:34,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:34,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:34,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:34,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:34,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:34,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:34,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:34,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:34,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:34,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:34,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:35,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-24 14:18:36,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:36,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 14:18:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 14:18:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 14:18:36,804 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-12-24 14:18:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:37,245 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-24 14:18:37,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 14:18:37,245 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-12-24 14:18:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:37,247 INFO L225 Difference]: With dead ends: 147 [2018-12-24 14:18:37,247 INFO L226 Difference]: Without dead ends: 146 [2018-12-24 14:18:37,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 14:18:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-24 14:18:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-24 14:18:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-24 14:18:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-12-24 14:18:37,254 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-12-24 14:18:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:37,254 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-12-24 14:18:37,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 14:18:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-12-24 14:18:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-24 14:18:37,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:37,255 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-12-24 14:18:37,256 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-12-24 14:18:37,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:37,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:37,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:38,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:38,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:38,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:38,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:38,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:38,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:38,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:38,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-24 14:18:38,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:38,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:38,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:38,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:38,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:38,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:39,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:41,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:41,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-24 14:18:41,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:41,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 14:18:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 14:18:41,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:18:41,282 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-12-24 14:18:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:41,695 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-24 14:18:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 14:18:41,696 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-12-24 14:18:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:41,697 INFO L225 Difference]: With dead ends: 151 [2018-12-24 14:18:41,698 INFO L226 Difference]: Without dead ends: 150 [2018-12-24 14:18:41,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:18:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-24 14:18:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-12-24 14:18:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 14:18:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-12-24 14:18:41,703 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-12-24 14:18:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:41,703 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-12-24 14:18:41,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 14:18:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-12-24 14:18:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-24 14:18:41,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:41,705 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-12-24 14:18:41,705 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:41,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-12-24 14:18:41,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:41,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:41,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:42,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:42,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:42,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:42,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:42,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:42,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:42,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:42,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:42,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:42,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:42,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:42,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:42,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:42,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:42,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:44,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:45,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-24 14:18:45,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:45,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 14:18:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 14:18:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 14:18:45,944 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-12-24 14:18:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:46,270 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-24 14:18:46,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 14:18:46,270 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-12-24 14:18:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:46,271 INFO L225 Difference]: With dead ends: 155 [2018-12-24 14:18:46,272 INFO L226 Difference]: Without dead ends: 154 [2018-12-24 14:18:46,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 14:18:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-24 14:18:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-12-24 14:18:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-24 14:18:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-12-24 14:18:46,278 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-12-24 14:18:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:46,279 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-12-24 14:18:46,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 14:18:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-12-24 14:18:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-24 14:18:46,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:46,280 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-12-24 14:18:46,280 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:46,280 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-12-24 14:18:46,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:46,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:46,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:47,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:47,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:47,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:47,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:47,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:47,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:47,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:47,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:47,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:47,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:47,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:47,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:47,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:48,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:50,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-24 14:18:50,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:50,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 14:18:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 14:18:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:18:50,564 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-12-24 14:18:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:50,805 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-24 14:18:50,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 14:18:50,805 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-12-24 14:18:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:50,807 INFO L225 Difference]: With dead ends: 159 [2018-12-24 14:18:50,807 INFO L226 Difference]: Without dead ends: 158 [2018-12-24 14:18:50,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:18:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-24 14:18:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-12-24 14:18:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-24 14:18:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-12-24 14:18:50,813 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-12-24 14:18:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:50,814 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-12-24 14:18:50,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 14:18:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-12-24 14:18:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-24 14:18:50,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:50,815 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-12-24 14:18:50,815 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-12-24 14:18:50,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:50,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:50,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:51,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:51,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:51,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:51,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:51,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:51,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:51,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:51,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-24 14:18:51,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:51,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:51,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:51,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:51,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:51,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:52,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:55,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:55,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-24 14:18:55,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:55,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 14:18:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 14:18:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 14:18:55,125 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-12-24 14:18:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:55,432 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-24 14:18:55,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 14:18:55,433 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-12-24 14:18:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:55,434 INFO L225 Difference]: With dead ends: 163 [2018-12-24 14:18:55,434 INFO L226 Difference]: Without dead ends: 162 [2018-12-24 14:18:55,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 14:18:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-24 14:18:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-12-24 14:18:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-24 14:18:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-12-24 14:18:55,440 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-12-24 14:18:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:55,441 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-12-24 14:18:55,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 14:18:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-12-24 14:18:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-24 14:18:55,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:55,442 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-12-24 14:18:55,442 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-12-24 14:18:55,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:55,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:55,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:56,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:56,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:56,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:56,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:56,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:56,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:56,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:56,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:56,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:56,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:56,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:18:56,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:18:56,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:18:56,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:18:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:18:57,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:00,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-24 14:19:00,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:00,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 14:19:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 14:19:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:19:00,307 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-12-24 14:19:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:00,741 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-24 14:19:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 14:19:00,742 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-12-24 14:19:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:00,743 INFO L225 Difference]: With dead ends: 167 [2018-12-24 14:19:00,744 INFO L226 Difference]: Without dead ends: 166 [2018-12-24 14:19:00,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:19:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-24 14:19:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-12-24 14:19:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-24 14:19:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-12-24 14:19:00,750 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-12-24 14:19:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:00,750 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-12-24 14:19:00,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 14:19:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-12-24 14:19:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-24 14:19:00,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:00,751 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-12-24 14:19:00,751 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:00,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-12-24 14:19:00,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:00,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:00,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:02,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:02,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:02,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:02,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:02,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:02,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:02,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:02,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:02,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:02,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:02,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:02,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:02,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:03,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-24 14:19:06,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:06,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 14:19:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 14:19:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 14:19:06,110 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-12-24 14:19:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:06,399 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-24 14:19:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 14:19:06,399 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-12-24 14:19:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:06,400 INFO L225 Difference]: With dead ends: 171 [2018-12-24 14:19:06,400 INFO L226 Difference]: Without dead ends: 170 [2018-12-24 14:19:06,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 14:19:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-24 14:19:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-24 14:19:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-24 14:19:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-12-24 14:19:06,406 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-12-24 14:19:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:06,407 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-12-24 14:19:06,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 14:19:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-12-24 14:19:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-24 14:19:06,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:06,408 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-12-24 14:19:06,408 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-12-24 14:19:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:06,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:07,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:07,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:07,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:07,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:07,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:07,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:07,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:07,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:07,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-24 14:19:07,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:07,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:07,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:07,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:07,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:07,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:08,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:11,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:11,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-24 14:19:11,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:11,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 14:19:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 14:19:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:19:11,348 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-12-24 14:19:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:11,625 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-24 14:19:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 14:19:11,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-12-24 14:19:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:11,627 INFO L225 Difference]: With dead ends: 175 [2018-12-24 14:19:11,627 INFO L226 Difference]: Without dead ends: 174 [2018-12-24 14:19:11,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:19:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-24 14:19:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-12-24 14:19:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-24 14:19:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-12-24 14:19:11,634 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-12-24 14:19:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:11,634 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-12-24 14:19:11,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 14:19:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-12-24 14:19:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-24 14:19:11,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:11,635 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-12-24 14:19:11,635 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-12-24 14:19:11,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:11,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:11,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:12,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:12,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:12,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:12,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:12,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:12,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:12,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:12,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:12,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:12,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:12,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:12,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:12,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:12,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:12,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:13,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:16,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:16,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-24 14:19:16,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:16,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 14:19:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 14:19:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 14:19:16,659 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-12-24 14:19:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:17,219 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-24 14:19:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 14:19:17,219 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-12-24 14:19:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:17,221 INFO L225 Difference]: With dead ends: 179 [2018-12-24 14:19:17,221 INFO L226 Difference]: Without dead ends: 178 [2018-12-24 14:19:17,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 14:19:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-24 14:19:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-24 14:19:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-24 14:19:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-12-24 14:19:17,227 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-12-24 14:19:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:17,227 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-12-24 14:19:17,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 14:19:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-12-24 14:19:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-24 14:19:17,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:17,228 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-12-24 14:19:17,229 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-12-24 14:19:17,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:17,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:17,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:18,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:18,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:18,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:18,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:18,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:18,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:18,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:18,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:19,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:19,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:19,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:19,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:20,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:22,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-24 14:19:22,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:22,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 14:19:22,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 14:19:22,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:19:22,978 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-12-24 14:19:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:23,275 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-24 14:19:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 14:19:23,275 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-12-24 14:19:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:23,277 INFO L225 Difference]: With dead ends: 183 [2018-12-24 14:19:23,277 INFO L226 Difference]: Without dead ends: 182 [2018-12-24 14:19:23,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:19:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-24 14:19:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-12-24 14:19:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 14:19:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-12-24 14:19:23,282 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-12-24 14:19:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:23,282 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-12-24 14:19:23,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 14:19:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-12-24 14:19:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 14:19:23,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:23,283 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-12-24 14:19:23,283 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-12-24 14:19:23,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:23,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:23,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:23,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:23,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:24,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:24,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:24,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:24,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:24,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:24,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:24,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:24,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-24 14:19:24,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:24,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:24,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:24,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:24,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:24,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:26,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:28,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-24 14:19:28,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:28,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 14:19:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 14:19:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 14:19:28,729 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-12-24 14:19:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:29,072 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-24 14:19:29,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 14:19:29,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-12-24 14:19:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:29,074 INFO L225 Difference]: With dead ends: 187 [2018-12-24 14:19:29,074 INFO L226 Difference]: Without dead ends: 186 [2018-12-24 14:19:29,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 14:19:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-24 14:19:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-12-24 14:19:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-24 14:19:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-12-24 14:19:29,080 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-12-24 14:19:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:29,081 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-12-24 14:19:29,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 14:19:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-12-24 14:19:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-24 14:19:29,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:29,082 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-12-24 14:19:29,082 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:29,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-12-24 14:19:29,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:29,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:29,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:29,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:30,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:30,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:30,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:30,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:30,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:30,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:30,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:30,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:30,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:30,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:30,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:30,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:30,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:30,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:30,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:31,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:34,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:34,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-24 14:19:34,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:34,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 14:19:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 14:19:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:19:34,817 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-12-24 14:19:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:35,207 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-24 14:19:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 14:19:35,207 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-12-24 14:19:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:35,208 INFO L225 Difference]: With dead ends: 191 [2018-12-24 14:19:35,208 INFO L226 Difference]: Without dead ends: 190 [2018-12-24 14:19:35,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:19:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-24 14:19:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-12-24 14:19:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-24 14:19:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-12-24 14:19:35,214 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-12-24 14:19:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:35,215 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-12-24 14:19:35,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 14:19:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-12-24 14:19:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-24 14:19:35,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:35,216 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-12-24 14:19:35,216 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-12-24 14:19:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:35,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:35,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:36,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:36,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:36,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:36,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:36,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:36,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:36,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:36,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:36,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:36,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:36,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:36,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:36,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:39,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:42,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-24 14:19:42,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:42,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 14:19:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 14:19:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 14:19:42,698 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-12-24 14:19:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:43,038 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-24 14:19:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 14:19:43,038 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-12-24 14:19:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:43,040 INFO L225 Difference]: With dead ends: 195 [2018-12-24 14:19:43,040 INFO L226 Difference]: Without dead ends: 194 [2018-12-24 14:19:43,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 14:19:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-24 14:19:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-12-24 14:19:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-24 14:19:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-12-24 14:19:43,046 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-12-24 14:19:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:43,046 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-12-24 14:19:43,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 14:19:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-12-24 14:19:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-24 14:19:43,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:43,047 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-12-24 14:19:43,047 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-12-24 14:19:43,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:43,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:43,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:44,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:44,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:44,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:44,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:44,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:44,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:44,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:44,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:44,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-24 14:19:44,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:44,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:44,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:44,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:44,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:44,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:46,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:49,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:49,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-24 14:19:49,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:49,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 14:19:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 14:19:49,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:19:49,314 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-12-24 14:19:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:49,662 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-12-24 14:19:49,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 14:19:49,662 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-12-24 14:19:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:49,663 INFO L225 Difference]: With dead ends: 199 [2018-12-24 14:19:49,663 INFO L226 Difference]: Without dead ends: 198 [2018-12-24 14:19:49,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:19:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-24 14:19:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-12-24 14:19:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-24 14:19:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-12-24 14:19:49,670 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-12-24 14:19:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:49,671 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-12-24 14:19:49,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 14:19:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-12-24 14:19:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-24 14:19:49,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:49,672 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-12-24 14:19:49,672 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-12-24 14:19:49,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:49,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:49,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:51,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:51,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:51,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:51,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:51,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:51,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:51,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:51,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:51,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:51,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:51,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:51,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:51,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:51,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:52,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-24 14:19:56,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:56,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 14:19:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 14:19:56,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 14:19:56,117 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-12-24 14:19:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:56,496 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-12-24 14:19:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 14:19:56,497 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-12-24 14:19:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:56,498 INFO L225 Difference]: With dead ends: 203 [2018-12-24 14:19:56,498 INFO L226 Difference]: Without dead ends: 202 [2018-12-24 14:19:56,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 14:19:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-24 14:19:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-12-24 14:19:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-24 14:19:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-12-24 14:19:56,505 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-12-24 14:19:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:56,505 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-12-24 14:19:56,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 14:19:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-12-24 14:19:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-24 14:19:56,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:56,507 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-12-24 14:19:56,507 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-12-24 14:19:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:56,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:56,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:57,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:57,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:57,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:57,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:57,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:57,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:57,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:57,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:57,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:57,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:19:57,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:19:57,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:19:57,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:19:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:19:59,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:02,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:02,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-24 14:20:02,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:02,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 14:20:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 14:20:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:20:02,937 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-12-24 14:20:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:03,255 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-12-24 14:20:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 14:20:03,255 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-12-24 14:20:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:03,257 INFO L225 Difference]: With dead ends: 207 [2018-12-24 14:20:03,257 INFO L226 Difference]: Without dead ends: 206 [2018-12-24 14:20:03,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:20:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-24 14:20:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-12-24 14:20:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-24 14:20:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-12-24 14:20:03,264 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-12-24 14:20:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:03,264 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-12-24 14:20:03,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 14:20:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-12-24 14:20:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-24 14:20:03,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:03,266 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-12-24 14:20:03,266 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:03,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:03,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-12-24 14:20:03,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:03,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:03,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:03,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:03,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:04,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:04,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:04,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:04,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:04,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:04,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:04,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-24 14:20:04,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:04,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:04,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:04,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:04,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:06,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:09,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:09,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2018-12-24 14:20:09,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:09,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 14:20:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 14:20:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 14:20:09,934 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-12-24 14:20:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:10,339 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-12-24 14:20:10,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 14:20:10,340 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-12-24 14:20:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:10,341 INFO L225 Difference]: With dead ends: 211 [2018-12-24 14:20:10,341 INFO L226 Difference]: Without dead ends: 210 [2018-12-24 14:20:10,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 14:20:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-24 14:20:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-12-24 14:20:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-24 14:20:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-12-24 14:20:10,348 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-12-24 14:20:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:10,348 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-12-24 14:20:10,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 14:20:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-12-24 14:20:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-24 14:20:10,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:10,349 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-12-24 14:20:10,349 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-12-24 14:20:10,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:10,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:10,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:10,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:12,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:12,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:12,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:12,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:12,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:12,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:12,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:12,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:12,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:12,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:12,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:12,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:12,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:12,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:12,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:14,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:17,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:17,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2018-12-24 14:20:17,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:17,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 14:20:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 14:20:17,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:20:17,830 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-12-24 14:20:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:18,267 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-12-24 14:20:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 14:20:18,267 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-12-24 14:20:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:18,269 INFO L225 Difference]: With dead ends: 215 [2018-12-24 14:20:18,269 INFO L226 Difference]: Without dead ends: 214 [2018-12-24 14:20:18,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:20:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-24 14:20:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-12-24 14:20:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-24 14:20:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-12-24 14:20:18,277 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-12-24 14:20:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:18,277 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-12-24 14:20:18,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 14:20:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-12-24 14:20:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-24 14:20:18,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:18,278 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-12-24 14:20:18,279 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-12-24 14:20:18,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:18,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:18,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:19,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:19,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:19,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:19,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:19,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:19,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:19,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:19,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:19,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:19,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:19,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:19,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:21,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:25,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:25,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2018-12-24 14:20:25,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:25,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 14:20:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 14:20:25,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 14:20:25,119 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-12-24 14:20:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:25,495 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-12-24 14:20:25,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 14:20:25,495 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-12-24 14:20:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:25,497 INFO L225 Difference]: With dead ends: 219 [2018-12-24 14:20:25,497 INFO L226 Difference]: Without dead ends: 218 [2018-12-24 14:20:25,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 14:20:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-24 14:20:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-12-24 14:20:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-24 14:20:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-12-24 14:20:25,502 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-12-24 14:20:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:25,502 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-12-24 14:20:25,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 14:20:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-12-24 14:20:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-24 14:20:25,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:25,504 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-12-24 14:20:25,504 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-12-24 14:20:25,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:25,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:25,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:27,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:27,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:27,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:27,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:27,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:27,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:27,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:27,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:27,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-24 14:20:27,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:27,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:27,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:27,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:27,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:27,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:29,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:32,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:32,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2018-12-24 14:20:32,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:32,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 14:20:32,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 14:20:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:20:32,901 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-12-24 14:20:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:33,280 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-12-24 14:20:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 14:20:33,281 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-12-24 14:20:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:33,282 INFO L225 Difference]: With dead ends: 223 [2018-12-24 14:20:33,283 INFO L226 Difference]: Without dead ends: 222 [2018-12-24 14:20:33,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:20:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-24 14:20:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-12-24 14:20:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-24 14:20:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-12-24 14:20:33,288 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-12-24 14:20:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:33,288 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-12-24 14:20:33,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 14:20:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-12-24 14:20:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-24 14:20:33,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:33,289 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-12-24 14:20:33,289 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-12-24 14:20:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:33,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:33,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:34,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:34,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:34,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:34,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:34,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:34,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:34,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:34,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:34,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:34,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:34,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:34,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:37,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:40,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:40,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2018-12-24 14:20:40,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:40,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 14:20:40,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 14:20:40,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 14:20:40,452 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-12-24 14:20:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:40,913 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-12-24 14:20:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 14:20:40,914 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-12-24 14:20:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:40,915 INFO L225 Difference]: With dead ends: 227 [2018-12-24 14:20:40,916 INFO L226 Difference]: Without dead ends: 226 [2018-12-24 14:20:40,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 14:20:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-24 14:20:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-12-24 14:20:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-24 14:20:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-12-24 14:20:40,922 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-12-24 14:20:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:40,922 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-12-24 14:20:40,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 14:20:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-12-24 14:20:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-24 14:20:40,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:40,924 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-12-24 14:20:40,924 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-12-24 14:20:40,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:40,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:40,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:42,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:42,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:42,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:42,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:42,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:42,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:42,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:42,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:42,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:42,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:42,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:42,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:44,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:48,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:48,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2018-12-24 14:20:48,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:48,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-24 14:20:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-24 14:20:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:20:48,448 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-12-24 14:20:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:48,922 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-12-24 14:20:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 14:20:48,923 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-12-24 14:20:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:48,924 INFO L225 Difference]: With dead ends: 231 [2018-12-24 14:20:48,925 INFO L226 Difference]: Without dead ends: 230 [2018-12-24 14:20:48,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:20:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-24 14:20:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-12-24 14:20:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-24 14:20:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-12-24 14:20:48,932 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-12-24 14:20:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:48,932 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-12-24 14:20:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-24 14:20:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-12-24 14:20:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-24 14:20:48,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:48,934 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-12-24 14:20:48,934 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-12-24 14:20:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:48,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:50,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:50,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:50,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:50,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:50,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:50,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:50,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:50,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-24 14:20:50,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:50,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:50,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:50,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:50,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:50,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:20:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:52,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:56,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2018-12-24 14:20:56,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-24 14:20:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-24 14:20:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 14:20:56,515 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-12-24 14:20:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:57,063 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-12-24 14:20:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 14:20:57,063 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-12-24 14:20:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:57,064 INFO L225 Difference]: With dead ends: 235 [2018-12-24 14:20:57,064 INFO L226 Difference]: Without dead ends: 234 [2018-12-24 14:20:57,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 14:20:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-24 14:20:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-12-24 14:20:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-24 14:20:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-12-24 14:20:57,071 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-12-24 14:20:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:57,071 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-12-24 14:20:57,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-24 14:20:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-12-24 14:20:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-24 14:20:57,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:57,073 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-12-24 14:20:57,073 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-12-24 14:20:57,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:57,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:57,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:20:58,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:58,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:58,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:58,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:58,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:58,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:20:58,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:58,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:58,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:58,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:58,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:58,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:20:58,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:20:59,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:20:59,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:01,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:05,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:05,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2018-12-24 14:21:05,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-24 14:21:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-24 14:21:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:21:05,055 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-12-24 14:21:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:05,518 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-12-24 14:21:05,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 14:21:05,519 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-12-24 14:21:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:05,520 INFO L225 Difference]: With dead ends: 239 [2018-12-24 14:21:05,520 INFO L226 Difference]: Without dead ends: 238 [2018-12-24 14:21:05,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:21:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-24 14:21:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-12-24 14:21:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-24 14:21:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-12-24 14:21:05,526 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-12-24 14:21:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:05,526 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-12-24 14:21:05,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-24 14:21:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-12-24 14:21:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-24 14:21:05,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:05,527 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-12-24 14:21:05,527 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-12-24 14:21:05,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:05,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:05,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:07,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:07,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:07,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:07,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:07,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:07,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:21:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:07,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:07,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:07,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:07,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:07,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:09,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:13,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:13,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2018-12-24 14:21:13,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:13,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-24 14:21:13,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-24 14:21:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 14:21:13,556 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-12-24 14:21:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:14,012 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-12-24 14:21:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 14:21:14,013 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-12-24 14:21:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:14,014 INFO L225 Difference]: With dead ends: 243 [2018-12-24 14:21:14,014 INFO L226 Difference]: Without dead ends: 242 [2018-12-24 14:21:14,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 14:21:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-24 14:21:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-12-24 14:21:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-24 14:21:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-12-24 14:21:14,019 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-12-24 14:21:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:14,019 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-12-24 14:21:14,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-24 14:21:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-12-24 14:21:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-24 14:21:14,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:14,020 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-12-24 14:21:14,021 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-12-24 14:21:14,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:14,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:14,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:15,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:15,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:15,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:15,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:15,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:15,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:15,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:15,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:16,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-24 14:21:16,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:16,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:16,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:16,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:16,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:16,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:18,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:22,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:22,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2018-12-24 14:21:22,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:22,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-24 14:21:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-24 14:21:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:21:22,257 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-12-24 14:21:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:22,827 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-12-24 14:21:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 14:21:22,827 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-12-24 14:21:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:22,829 INFO L225 Difference]: With dead ends: 247 [2018-12-24 14:21:22,829 INFO L226 Difference]: Without dead ends: 246 [2018-12-24 14:21:22,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:21:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-24 14:21:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-12-24 14:21:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-24 14:21:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-12-24 14:21:22,836 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-12-24 14:21:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-12-24 14:21:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-24 14:21:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-12-24 14:21:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-24 14:21:22,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:22,838 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-12-24 14:21:22,838 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-12-24 14:21:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:22,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:22,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:24,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:24,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:24,655 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:24,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:24,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:24,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:24,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:24,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:24,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:24,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:24,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:24,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:24,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:24,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:24,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:26,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:30,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2018-12-24 14:21:30,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:30,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-24 14:21:30,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-24 14:21:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 14:21:30,885 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-12-24 14:21:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:31,371 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-12-24 14:21:31,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 14:21:31,371 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-12-24 14:21:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:31,372 INFO L225 Difference]: With dead ends: 251 [2018-12-24 14:21:31,372 INFO L226 Difference]: Without dead ends: 250 [2018-12-24 14:21:31,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 14:21:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-24 14:21:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-12-24 14:21:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-24 14:21:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-12-24 14:21:31,380 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-12-24 14:21:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:31,380 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-12-24 14:21:31,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-24 14:21:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-12-24 14:21:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-24 14:21:31,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:31,381 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-12-24 14:21:31,382 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-12-24 14:21:31,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:31,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:31,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:31,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:33,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:33,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:33,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:33,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:33,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:33,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:21:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:33,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:33,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:33,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:33,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:33,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:36,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:40,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:40,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2018-12-24 14:21:40,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:40,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-24 14:21:40,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-24 14:21:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:21:40,025 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-12-24 14:21:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:40,470 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-12-24 14:21:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 14:21:40,470 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-12-24 14:21:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:40,472 INFO L225 Difference]: With dead ends: 255 [2018-12-24 14:21:40,472 INFO L226 Difference]: Without dead ends: 254 [2018-12-24 14:21:40,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:21:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-24 14:21:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-12-24 14:21:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-24 14:21:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-12-24 14:21:40,478 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-12-24 14:21:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:40,478 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-12-24 14:21:40,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-24 14:21:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-12-24 14:21:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-24 14:21:40,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:40,479 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-12-24 14:21:40,479 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-12-24 14:21:40,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:40,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:40,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:42,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:42,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:42,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:42,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:42,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:42,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:42,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:42,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:42,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-24 14:21:42,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:42,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:42,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:42,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:42,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:42,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:45,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:49,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:49,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2018-12-24 14:21:49,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:49,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-24 14:21:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-24 14:21:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 14:21:49,096 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-12-24 14:21:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:49,551 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-12-24 14:21:49,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 14:21:49,551 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-12-24 14:21:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:49,552 INFO L225 Difference]: With dead ends: 259 [2018-12-24 14:21:49,552 INFO L226 Difference]: Without dead ends: 258 [2018-12-24 14:21:49,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 14:21:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-24 14:21:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-12-24 14:21:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-24 14:21:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-12-24 14:21:49,558 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-12-24 14:21:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:49,558 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-12-24 14:21:49,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-24 14:21:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-12-24 14:21:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-24 14:21:49,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:49,559 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-12-24 14:21:49,560 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-12-24 14:21:49,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:49,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:49,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:49,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:51,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:51,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:51,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:51,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:51,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:51,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:21:51,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:51,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:51,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:51,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:51,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:51,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:21:51,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:21:51,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:21:51,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:21:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:54,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:21:58,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:58,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2018-12-24 14:21:58,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:58,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-24 14:21:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-24 14:21:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:21:58,191 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-12-24 14:21:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:58,722 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-12-24 14:21:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 14:21:58,722 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-12-24 14:21:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:58,723 INFO L225 Difference]: With dead ends: 263 [2018-12-24 14:21:58,723 INFO L226 Difference]: Without dead ends: 262 [2018-12-24 14:21:58,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:21:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-24 14:21:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-12-24 14:21:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-24 14:21:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-12-24 14:21:58,730 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-12-24 14:21:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:58,731 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-12-24 14:21:58,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-24 14:21:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-12-24 14:21:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-24 14:21:58,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:58,732 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-12-24 14:21:58,732 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:58,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:58,733 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-12-24 14:21:58,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:58,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:58,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:58,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:00,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:00,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:00,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:00,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:00,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:00,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:00,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:00,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:22:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:00,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:00,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:00,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:00,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:00,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:03,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:07,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:07,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2018-12-24 14:22:07,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:07,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-24 14:22:07,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-24 14:22:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 14:22:07,454 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-12-24 14:22:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:07,923 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-12-24 14:22:07,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 14:22:07,923 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-12-24 14:22:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:07,925 INFO L225 Difference]: With dead ends: 267 [2018-12-24 14:22:07,925 INFO L226 Difference]: Without dead ends: 266 [2018-12-24 14:22:07,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 14:22:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-24 14:22:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-12-24 14:22:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-24 14:22:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-12-24 14:22:07,931 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-12-24 14:22:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:07,931 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-12-24 14:22:07,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-24 14:22:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-12-24 14:22:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-24 14:22:07,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:07,933 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-12-24 14:22:07,933 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-12-24 14:22:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:07,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:10,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:10,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:10,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:10,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:10,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:10,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:22:10,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:22:10,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-24 14:22:10,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:10,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:10,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:10,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:10,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:10,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:13,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:17,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:17,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2018-12-24 14:22:17,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:17,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-24 14:22:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-24 14:22:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:22:17,247 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-12-24 14:22:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:17,789 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-12-24 14:22:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 14:22:17,789 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-12-24 14:22:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:17,791 INFO L225 Difference]: With dead ends: 271 [2018-12-24 14:22:17,791 INFO L226 Difference]: Without dead ends: 270 [2018-12-24 14:22:17,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:22:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-24 14:22:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-12-24 14:22:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-24 14:22:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-12-24 14:22:17,798 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-12-24 14:22:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:17,798 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-12-24 14:22:17,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-24 14:22:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-12-24 14:22:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-24 14:22:17,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:17,800 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-12-24 14:22:17,800 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-12-24 14:22:17,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:17,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:17,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:20,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:20,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:20,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:20,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:20,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:20,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:20,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:20,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:20,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:20,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:20,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:20,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:20,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:20,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:23,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:27,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:27,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2018-12-24 14:22:27,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:27,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-24 14:22:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-24 14:22:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 14:22:27,136 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-12-24 14:22:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:27,625 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-12-24 14:22:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 14:22:27,626 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-12-24 14:22:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:27,627 INFO L225 Difference]: With dead ends: 275 [2018-12-24 14:22:27,627 INFO L226 Difference]: Without dead ends: 274 [2018-12-24 14:22:27,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 14:22:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-24 14:22:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-12-24 14:22:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-24 14:22:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-12-24 14:22:27,632 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-12-24 14:22:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:27,632 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-12-24 14:22:27,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-24 14:22:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-12-24 14:22:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-24 14:22:27,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:27,633 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-12-24 14:22:27,634 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-12-24 14:22:27,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:27,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:27,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:27,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:30,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:30,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:30,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:30,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:30,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:30,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:30,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:30,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:22:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:30,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:30,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:30,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:30,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:30,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:32,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:37,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:37,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2018-12-24 14:22:37,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:37,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-24 14:22:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-24 14:22:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:22:37,233 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-12-24 14:22:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:37,827 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-12-24 14:22:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 14:22:37,828 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-12-24 14:22:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:37,829 INFO L225 Difference]: With dead ends: 279 [2018-12-24 14:22:37,829 INFO L226 Difference]: Without dead ends: 278 [2018-12-24 14:22:37,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:22:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-24 14:22:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-12-24 14:22:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-24 14:22:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-12-24 14:22:37,834 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-12-24 14:22:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:37,835 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-12-24 14:22:37,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-24 14:22:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-12-24 14:22:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-24 14:22:37,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:37,837 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-12-24 14:22:37,837 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-12-24 14:22:37,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:37,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:37,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:40,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:40,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:40,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:40,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:40,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:40,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:40,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:22:40,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:22:40,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-24 14:22:40,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:40,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:40,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:40,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:40,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:40,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:43,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:47,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:47,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2018-12-24 14:22:47,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:47,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-24 14:22:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-24 14:22:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 14:22:47,773 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-12-24 14:22:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:48,285 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-12-24 14:22:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 14:22:48,285 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-12-24 14:22:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:48,287 INFO L225 Difference]: With dead ends: 283 [2018-12-24 14:22:48,287 INFO L226 Difference]: Without dead ends: 282 [2018-12-24 14:22:48,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 14:22:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-24 14:22:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-12-24 14:22:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-24 14:22:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-12-24 14:22:48,293 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-12-24 14:22:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:48,293 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-12-24 14:22:48,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-24 14:22:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-12-24 14:22:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-24 14:22:48,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:48,295 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-12-24 14:22:48,295 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-12-24 14:22:48,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:48,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:48,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:51,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:51,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:51,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:51,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:51,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:51,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:22:51,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:51,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:51,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:51,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:51,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:51,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:22:51,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:22:51,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:22:51,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:22:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:54,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:22:58,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:58,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2018-12-24 14:22:58,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:58,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-24 14:22:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-24 14:22:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:22:58,235 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-12-24 14:22:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:58,780 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-12-24 14:22:58,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 14:22:58,780 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-12-24 14:22:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:58,782 INFO L225 Difference]: With dead ends: 287 [2018-12-24 14:22:58,782 INFO L226 Difference]: Without dead ends: 286 [2018-12-24 14:22:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:22:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-24 14:22:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-12-24 14:22:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-24 14:22:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-12-24 14:22:58,787 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-12-24 14:22:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:58,788 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-12-24 14:22:58,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-24 14:22:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-12-24 14:22:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-24 14:22:58,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:58,789 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-12-24 14:22:58,789 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-12-24 14:22:58,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:58,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:58,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:01,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:01,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:01,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:01,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:01,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:01,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:01,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:01,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:01,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:01,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:01,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:01,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:01,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:04,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:08,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:08,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2018-12-24 14:23:08,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:08,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-24 14:23:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-24 14:23:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 14:23:08,892 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-12-24 14:23:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:09,448 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-12-24 14:23:09,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 14:23:09,448 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-12-24 14:23:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:09,450 INFO L225 Difference]: With dead ends: 291 [2018-12-24 14:23:09,450 INFO L226 Difference]: Without dead ends: 290 [2018-12-24 14:23:09,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 14:23:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-24 14:23:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-12-24 14:23:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-24 14:23:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-12-24 14:23:09,455 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-12-24 14:23:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:09,456 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-12-24 14:23:09,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-24 14:23:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-12-24 14:23:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-24 14:23:09,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:09,457 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-12-24 14:23:09,457 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-12-24 14:23:09,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:09,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:09,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:12,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:12,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:12,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:12,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:12,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:23:12,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:23:12,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-24 14:23:12,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:12,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:12,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:12,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:12,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:12,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:15,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:19,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:19,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2018-12-24 14:23:19,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:19,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-24 14:23:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-24 14:23:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:23:19,970 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-12-24 14:23:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:20,626 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-12-24 14:23:20,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 14:23:20,626 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-12-24 14:23:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:20,628 INFO L225 Difference]: With dead ends: 295 [2018-12-24 14:23:20,628 INFO L226 Difference]: Without dead ends: 294 [2018-12-24 14:23:20,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:23:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-24 14:23:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-12-24 14:23:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-24 14:23:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-12-24 14:23:20,634 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-12-24 14:23:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:20,634 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-12-24 14:23:20,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-24 14:23:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-12-24 14:23:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-24 14:23:20,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:20,636 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-12-24 14:23:20,636 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-12-24 14:23:20,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:20,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:20,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:23,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:23,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:23,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:23,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:23,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:23,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:23,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:23:23,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:23:23,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:23:23,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:23,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:23,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:23,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:23,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:23,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:26,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:31,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:31,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2018-12-24 14:23:31,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:31,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-24 14:23:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-24 14:23:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 14:23:31,086 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-12-24 14:23:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:31,721 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-12-24 14:23:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 14:23:31,721 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-12-24 14:23:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:31,723 INFO L225 Difference]: With dead ends: 299 [2018-12-24 14:23:31,723 INFO L226 Difference]: Without dead ends: 298 [2018-12-24 14:23:31,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 14:23:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-24 14:23:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-12-24 14:23:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-24 14:23:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-12-24 14:23:31,729 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-12-24 14:23:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:31,729 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-12-24 14:23:31,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-24 14:23:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-12-24 14:23:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-12-24 14:23:31,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:31,731 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-12-24 14:23:31,731 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-12-24 14:23:31,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:31,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:31,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:34,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:34,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:34,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:34,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:34,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:34,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:34,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:34,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:34,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:34,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:34,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:34,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:34,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:37,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:42,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:42,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2018-12-24 14:23:42,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:42,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-24 14:23:42,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-24 14:23:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:23:42,143 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-12-24 14:23:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:42,659 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-12-24 14:23:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 14:23:42,660 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-12-24 14:23:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:42,662 INFO L225 Difference]: With dead ends: 303 [2018-12-24 14:23:42,662 INFO L226 Difference]: Without dead ends: 302 [2018-12-24 14:23:42,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:23:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-24 14:23:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-12-24 14:23:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-24 14:23:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-12-24 14:23:42,667 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-12-24 14:23:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:42,667 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-12-24 14:23:42,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-24 14:23:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-12-24 14:23:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-24 14:23:42,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:42,669 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-12-24 14:23:42,669 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-12-24 14:23:42,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:42,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:42,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:42,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:42,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:45,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:45,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:45,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:45,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:45,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:45,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:23:45,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:23:45,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-24 14:23:45,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:45,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:45,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:45,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:45,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:45,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:23:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:49,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:53,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:53,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2018-12-24 14:23:53,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:53,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-24 14:23:53,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-24 14:23:53,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 14:23:53,516 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-12-24 14:23:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:54,143 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-12-24 14:23:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 14:23:54,144 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-12-24 14:23:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:54,146 INFO L225 Difference]: With dead ends: 307 [2018-12-24 14:23:54,146 INFO L226 Difference]: Without dead ends: 306 [2018-12-24 14:23:54,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 14:23:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-24 14:23:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-24 14:23:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-24 14:23:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-12-24 14:23:54,152 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-12-24 14:23:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:54,152 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-12-24 14:23:54,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-24 14:23:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-12-24 14:23:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-24 14:23:54,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:54,172 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-12-24 14:23:54,172 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-12-24 14:23:54,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:54,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:54,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:23:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:57,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:57,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:57,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:57,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:57,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:23:57,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:23:57,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:23:57,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:23:57,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:57,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:57,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:23:57,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:23:57,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:23:57,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:00,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:04,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2018-12-24 14:24:04,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-24 14:24:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-24 14:24:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:24:04,948 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-12-24 14:24:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:05,546 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-12-24 14:24:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 14:24:05,547 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-12-24 14:24:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:05,549 INFO L225 Difference]: With dead ends: 311 [2018-12-24 14:24:05,549 INFO L226 Difference]: Without dead ends: 310 [2018-12-24 14:24:05,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:24:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-24 14:24:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-12-24 14:24:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-12-24 14:24:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-12-24 14:24:05,556 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-12-24 14:24:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:05,556 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-12-24 14:24:05,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-24 14:24:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-12-24 14:24:05,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-24 14:24:05,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:05,558 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-12-24 14:24:05,558 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:05,559 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-12-24 14:24:05,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:05,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:05,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:08,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:08,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:08,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:08,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:08,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:08,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:08,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:08,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:24:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:08,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:08,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:08,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:08,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:08,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:12,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:16,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:16,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2018-12-24 14:24:16,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:16,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-24 14:24:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-24 14:24:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 14:24:16,935 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2018-12-24 14:24:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:17,542 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-12-24 14:24:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 14:24:17,543 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2018-12-24 14:24:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:17,544 INFO L225 Difference]: With dead ends: 315 [2018-12-24 14:24:17,544 INFO L226 Difference]: Without dead ends: 314 [2018-12-24 14:24:17,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 14:24:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-24 14:24:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-12-24 14:24:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-12-24 14:24:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-12-24 14:24:17,550 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2018-12-24 14:24:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:17,550 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-12-24 14:24:17,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-24 14:24:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-12-24 14:24:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-24 14:24:17,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:17,552 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2018-12-24 14:24:17,552 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:17,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:17,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2018-12-24 14:24:17,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:17,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:17,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:20,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:20,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:20,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:20,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:20,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:20,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:24:20,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:24:20,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-24 14:24:20,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:20,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:20,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:20,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:20,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:20,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:24,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:29,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:29,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2018-12-24 14:24:29,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:29,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-24 14:24:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-24 14:24:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:24:29,108 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2018-12-24 14:24:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:29,717 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-12-24 14:24:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 14:24:29,718 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2018-12-24 14:24:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:29,719 INFO L225 Difference]: With dead ends: 319 [2018-12-24 14:24:29,719 INFO L226 Difference]: Without dead ends: 318 [2018-12-24 14:24:29,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:24:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-24 14:24:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2018-12-24 14:24:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-24 14:24:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-12-24 14:24:29,725 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2018-12-24 14:24:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:29,725 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-12-24 14:24:29,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-24 14:24:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-12-24 14:24:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-12-24 14:24:29,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:29,726 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2018-12-24 14:24:29,727 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2018-12-24 14:24:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:29,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:29,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:32,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:32,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:32,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:32,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:32,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:32,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:24:33,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:24:33,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:24:33,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:33,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:33,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:33,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:33,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:33,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:36,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:41,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:41,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2018-12-24 14:24:41,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:41,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-24 14:24:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-24 14:24:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 14:24:41,241 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2018-12-24 14:24:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:41,932 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-12-24 14:24:41,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 14:24:41,932 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2018-12-24 14:24:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:41,934 INFO L225 Difference]: With dead ends: 323 [2018-12-24 14:24:41,935 INFO L226 Difference]: Without dead ends: 322 [2018-12-24 14:24:41,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 14:24:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-24 14:24:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-12-24 14:24:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-24 14:24:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-12-24 14:24:41,940 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2018-12-24 14:24:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:41,941 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-12-24 14:24:41,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-24 14:24:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-12-24 14:24:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-12-24 14:24:41,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:41,942 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2018-12-24 14:24:41,942 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2018-12-24 14:24:41,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:41,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:41,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:45,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:45,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:45,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:45,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:45,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:45,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:45,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:24:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:45,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:45,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:45,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:45,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:45,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:24:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:49,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:53,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2018-12-24 14:24:53,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:53,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-24 14:24:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-24 14:24:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:24:53,720 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2018-12-24 14:24:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:54,367 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-12-24 14:24:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 14:24:54,367 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2018-12-24 14:24:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:54,369 INFO L225 Difference]: With dead ends: 327 [2018-12-24 14:24:54,369 INFO L226 Difference]: Without dead ends: 326 [2018-12-24 14:24:54,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:24:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-24 14:24:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-12-24 14:24:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-24 14:24:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-12-24 14:24:54,375 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2018-12-24 14:24:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:54,375 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-12-24 14:24:54,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-24 14:24:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-12-24 14:24:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-24 14:24:54,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:54,376 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2018-12-24 14:24:54,376 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2018-12-24 14:24:54,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:54,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:54,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:24:57,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:57,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:57,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:57,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:57,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:57,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:24:57,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:24:57,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:24:58,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-24 14:24:58,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:58,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:58,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:24:58,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:24:58,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:24:58,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:01,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:06,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2018-12-24 14:25:06,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:06,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-24 14:25:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-24 14:25:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 14:25:06,283 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2018-12-24 14:25:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:07,027 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-12-24 14:25:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 14:25:07,028 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2018-12-24 14:25:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:07,030 INFO L225 Difference]: With dead ends: 331 [2018-12-24 14:25:07,030 INFO L226 Difference]: Without dead ends: 330 [2018-12-24 14:25:07,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 14:25:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-24 14:25:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-12-24 14:25:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-24 14:25:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-12-24 14:25:07,035 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2018-12-24 14:25:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:07,035 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-12-24 14:25:07,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-24 14:25:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-12-24 14:25:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-12-24 14:25:07,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:07,037 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2018-12-24 14:25:07,037 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2018-12-24 14:25:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:07,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:07,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:10,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:10,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:10,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:10,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:10,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:10,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:10,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:25:10,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:25:10,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:25:10,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:10,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:10,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:10,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:10,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:10,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:14,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:19,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:19,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2018-12-24 14:25:19,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:19,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-24 14:25:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-24 14:25:19,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:25:19,155 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2018-12-24 14:25:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:19,824 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-12-24 14:25:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 14:25:19,824 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2018-12-24 14:25:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:19,825 INFO L225 Difference]: With dead ends: 335 [2018-12-24 14:25:19,825 INFO L226 Difference]: Without dead ends: 334 [2018-12-24 14:25:19,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:25:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-24 14:25:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-12-24 14:25:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-12-24 14:25:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-12-24 14:25:19,831 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2018-12-24 14:25:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:19,832 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-12-24 14:25:19,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-24 14:25:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-12-24 14:25:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-24 14:25:19,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:19,833 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2018-12-24 14:25:19,833 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2018-12-24 14:25:19,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:19,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:19,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:23,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:23,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:23,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:23,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:23,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:23,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:23,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:23,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:25:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:23,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:23,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:23,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:23,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:23,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:27,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:31,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:31,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2018-12-24 14:25:31,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-24 14:25:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-24 14:25:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 14:25:31,688 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2018-12-24 14:25:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:32,333 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-12-24 14:25:32,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 14:25:32,333 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2018-12-24 14:25:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:32,335 INFO L225 Difference]: With dead ends: 339 [2018-12-24 14:25:32,335 INFO L226 Difference]: Without dead ends: 338 [2018-12-24 14:25:32,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 14:25:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-12-24 14:25:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-12-24 14:25:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-24 14:25:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-12-24 14:25:32,340 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2018-12-24 14:25:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-12-24 14:25:32,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-24 14:25:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-12-24 14:25:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-24 14:25:32,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:32,342 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2018-12-24 14:25:32,342 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2018-12-24 14:25:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:32,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:35,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:35,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:35,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:35,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:35,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:35,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:35,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:25:35,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:25:36,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-24 14:25:36,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:36,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:36,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:36,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:36,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:36,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:40,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:45,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2018-12-24 14:25:45,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:45,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-24 14:25:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-24 14:25:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:25:45,146 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2018-12-24 14:25:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:45,907 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-12-24 14:25:45,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 14:25:45,907 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2018-12-24 14:25:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:45,909 INFO L225 Difference]: With dead ends: 343 [2018-12-24 14:25:45,909 INFO L226 Difference]: Without dead ends: 342 [2018-12-24 14:25:45,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:25:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-12-24 14:25:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-12-24 14:25:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-24 14:25:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-12-24 14:25:45,916 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2018-12-24 14:25:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:45,916 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-12-24 14:25:45,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-24 14:25:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-12-24 14:25:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-12-24 14:25:45,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:45,918 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2018-12-24 14:25:45,918 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2018-12-24 14:25:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:45,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:45,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:49,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:49,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:49,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:49,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:25:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:25:49,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:25:49,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:25:49,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:49,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:49,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:25:49,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:25:49,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:25:49,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:25:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:53,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:25:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2018-12-24 14:25:58,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:58,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-24 14:25:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-24 14:25:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 14:25:58,329 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2018-12-24 14:25:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:59,167 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-12-24 14:25:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 14:25:59,168 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2018-12-24 14:25:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:59,169 INFO L225 Difference]: With dead ends: 347 [2018-12-24 14:25:59,169 INFO L226 Difference]: Without dead ends: 346 [2018-12-24 14:25:59,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 14:25:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-24 14:25:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2018-12-24 14:25:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-12-24 14:25:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-12-24 14:25:59,176 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2018-12-24 14:25:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:59,176 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-12-24 14:25:59,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-24 14:25:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-12-24 14:25:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-12-24 14:25:59,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:59,178 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2018-12-24 14:25:59,178 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2018-12-24 14:25:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:59,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:59,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:02,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:02,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:02,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:02,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:02,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:02,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:02,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:02,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:02,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:02,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:02,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:02,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:02,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:07,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:12,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2018-12-24 14:26:12,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:12,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-24 14:26:12,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-24 14:26:12,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:26:12,058 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2018-12-24 14:26:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:12,930 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-12-24 14:26:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 14:26:12,930 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2018-12-24 14:26:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:12,932 INFO L225 Difference]: With dead ends: 351 [2018-12-24 14:26:12,933 INFO L226 Difference]: Without dead ends: 350 [2018-12-24 14:26:12,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:26:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-24 14:26:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-12-24 14:26:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-24 14:26:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-12-24 14:26:12,939 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2018-12-24 14:26:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:12,940 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-12-24 14:26:12,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-24 14:26:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-12-24 14:26:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-12-24 14:26:12,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:12,941 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2018-12-24 14:26:12,941 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2018-12-24 14:26:12,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:12,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:16,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:16,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:16,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:16,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:16,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:16,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:16,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:17,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-24 14:26:17,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:17,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:17,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:17,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:17,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:17,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:22,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:26,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:26,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2018-12-24 14:26:26,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:26,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-24 14:26:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-24 14:26:26,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 14:26:26,741 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2018-12-24 14:26:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:27,500 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-12-24 14:26:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 14:26:27,500 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2018-12-24 14:26:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:27,502 INFO L225 Difference]: With dead ends: 355 [2018-12-24 14:26:27,502 INFO L226 Difference]: Without dead ends: 354 [2018-12-24 14:26:27,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 14:26:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-24 14:26:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2018-12-24 14:26:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-24 14:26:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-12-24 14:26:27,511 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2018-12-24 14:26:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:27,511 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-12-24 14:26:27,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-24 14:26:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-12-24 14:26:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-12-24 14:26:27,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:27,512 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2018-12-24 14:26:27,512 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2018-12-24 14:26:27,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:27,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:27,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:31,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:31,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:31,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:31,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:31,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:31,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:31,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:31,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:31,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:31,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:31,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:31,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:31,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:31,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:31,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:36,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:41,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:41,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2018-12-24 14:26:41,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:41,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-24 14:26:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-24 14:26:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:26:41,292 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2018-12-24 14:26:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:42,007 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-12-24 14:26:42,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 14:26:42,008 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2018-12-24 14:26:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:42,010 INFO L225 Difference]: With dead ends: 359 [2018-12-24 14:26:42,010 INFO L226 Difference]: Without dead ends: 358 [2018-12-24 14:26:42,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:26:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-24 14:26:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2018-12-24 14:26:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-24 14:26:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-12-24 14:26:42,016 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2018-12-24 14:26:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:42,017 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-12-24 14:26:42,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-24 14:26:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-12-24 14:26:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-12-24 14:26:42,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:42,018 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2018-12-24 14:26:42,018 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2018-12-24 14:26:42,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:42,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:42,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:46,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:46,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:46,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:46,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:46,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:46,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:46,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:46,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:46,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:46,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:46,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:46,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:46,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:51,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:55,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2018-12-24 14:26:55,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:55,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-24 14:26:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-24 14:26:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 14:26:55,327 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2018-12-24 14:26:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:56,199 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-12-24 14:26:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 14:26:56,199 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2018-12-24 14:26:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:56,201 INFO L225 Difference]: With dead ends: 363 [2018-12-24 14:26:56,201 INFO L226 Difference]: Without dead ends: 362 [2018-12-24 14:26:56,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 14:26:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-12-24 14:26:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-12-24 14:26:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-24 14:26:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-12-24 14:26:56,207 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2018-12-24 14:26:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:56,208 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-12-24 14:26:56,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-24 14:26:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-12-24 14:26:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-24 14:26:56,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:56,209 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2018-12-24 14:26:56,209 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:56,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2018-12-24 14:26:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:56,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:00,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:00,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:00,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:00,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:00,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:00,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:00,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:00,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:00,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-24 14:27:00,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:00,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:00,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:00,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:00,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:00,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:05,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:09,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:09,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2018-12-24 14:27:09,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:09,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-24 14:27:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-24 14:27:09,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:27:09,929 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2018-12-24 14:27:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:10,749 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-12-24 14:27:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 14:27:10,750 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2018-12-24 14:27:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:10,752 INFO L225 Difference]: With dead ends: 367 [2018-12-24 14:27:10,752 INFO L226 Difference]: Without dead ends: 366 [2018-12-24 14:27:10,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:27:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-24 14:27:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-12-24 14:27:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-24 14:27:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-12-24 14:27:10,759 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2018-12-24 14:27:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:10,759 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-12-24 14:27:10,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-24 14:27:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-12-24 14:27:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-12-24 14:27:10,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:10,761 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2018-12-24 14:27:10,761 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2018-12-24 14:27:10,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:10,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:10,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:14,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:14,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:14,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:14,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:14,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:14,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:14,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:14,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:14,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:14,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:14,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:14,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:14,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:14,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:14,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:19,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:24,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:24,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2018-12-24 14:27:24,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:24,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-24 14:27:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-24 14:27:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 14:27:24,319 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2018-12-24 14:27:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:25,030 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-12-24 14:27:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 14:27:25,030 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2018-12-24 14:27:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:25,032 INFO L225 Difference]: With dead ends: 371 [2018-12-24 14:27:25,032 INFO L226 Difference]: Without dead ends: 370 [2018-12-24 14:27:25,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 14:27:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-24 14:27:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2018-12-24 14:27:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-24 14:27:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-12-24 14:27:25,038 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2018-12-24 14:27:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:25,038 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-12-24 14:27:25,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-24 14:27:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-12-24 14:27:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-12-24 14:27:25,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:25,041 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2018-12-24 14:27:25,041 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2018-12-24 14:27:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:25,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:25,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:29,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:29,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:29,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:29,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:29,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:29,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:29,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:29,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:29,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:29,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:29,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:29,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:34,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2018-12-24 14:27:38,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:38,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-24 14:27:38,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-24 14:27:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:27:38,973 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2018-12-24 14:27:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:39,733 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-12-24 14:27:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 14:27:39,733 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2018-12-24 14:27:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:39,736 INFO L225 Difference]: With dead ends: 375 [2018-12-24 14:27:39,736 INFO L226 Difference]: Without dead ends: 374 [2018-12-24 14:27:39,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:27:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-24 14:27:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-12-24 14:27:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-24 14:27:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-12-24 14:27:39,743 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2018-12-24 14:27:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:39,743 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-12-24 14:27:39,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-24 14:27:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-12-24 14:27:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-12-24 14:27:39,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:39,744 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2018-12-24 14:27:39,745 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:39,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:39,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2018-12-24 14:27:39,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:39,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:39,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:39,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:44,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:44,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:44,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:44,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:44,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:44,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:44,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:44,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-24 14:27:44,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:44,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:44,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:44,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:44,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:44,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:49,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:54,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2018-12-24 14:27:54,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:54,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-24 14:27:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-24 14:27:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 14:27:54,435 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2018-12-24 14:27:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:55,169 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-12-24 14:27:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 14:27:55,169 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2018-12-24 14:27:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:55,171 INFO L225 Difference]: With dead ends: 379 [2018-12-24 14:27:55,171 INFO L226 Difference]: Without dead ends: 378 [2018-12-24 14:27:55,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 14:27:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-24 14:27:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-12-24 14:27:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-24 14:27:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-12-24 14:27:55,177 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2018-12-24 14:27:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:55,177 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-12-24 14:27:55,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-24 14:27:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-12-24 14:27:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-12-24 14:27:55,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:55,179 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2018-12-24 14:27:55,179 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2018-12-24 14:27:55,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:55,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:55,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:55,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:55,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:59,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:59,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:59,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:59,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:59,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:59,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:59,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:59,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:59,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:59,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:59,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:59,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:27:59,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:59,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:59,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:04,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2018-12-24 14:28:09,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:09,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-24 14:28:09,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-24 14:28:09,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:28:09,522 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2018-12-24 14:28:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:10,232 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-12-24 14:28:10,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 14:28:10,233 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2018-12-24 14:28:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:10,235 INFO L225 Difference]: With dead ends: 383 [2018-12-24 14:28:10,235 INFO L226 Difference]: Without dead ends: 382 [2018-12-24 14:28:10,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:28:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-24 14:28:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-12-24 14:28:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-24 14:28:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-12-24 14:28:10,243 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2018-12-24 14:28:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-12-24 14:28:10,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-24 14:28:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-12-24 14:28:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-12-24 14:28:10,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:10,245 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2018-12-24 14:28:10,245 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2018-12-24 14:28:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:10,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:10,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:14,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:14,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:14,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:14,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:14,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:14,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:14,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:14,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:14,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:14,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:28:14,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:14,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:14,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:20,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:24,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:24,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2018-12-24 14:28:24,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:24,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-24 14:28:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-24 14:28:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 14:28:24,949 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2018-12-24 14:28:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:25,759 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-12-24 14:28:25,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 14:28:25,760 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2018-12-24 14:28:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:25,762 INFO L225 Difference]: With dead ends: 387 [2018-12-24 14:28:25,762 INFO L226 Difference]: Without dead ends: 386 [2018-12-24 14:28:25,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 14:28:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-24 14:28:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-12-24 14:28:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-12-24 14:28:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-12-24 14:28:25,769 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2018-12-24 14:28:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:25,769 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-12-24 14:28:25,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-24 14:28:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-12-24 14:28:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-12-24 14:28:25,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:25,772 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2018-12-24 14:28:25,772 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2018-12-24 14:28:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:25,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:25,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:30,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:30,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:30,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:30,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:30,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:30,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:30,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:31,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-24 14:28:31,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:31,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:31,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:28:31,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:31,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:36,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:41,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:41,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2018-12-24 14:28:41,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:41,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-24 14:28:41,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-24 14:28:41,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:28:41,344 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2018-12-24 14:28:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:42,202 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-12-24 14:28:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 14:28:42,203 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2018-12-24 14:28:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:42,204 INFO L225 Difference]: With dead ends: 391 [2018-12-24 14:28:42,205 INFO L226 Difference]: Without dead ends: 390 [2018-12-24 14:28:42,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:28:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-12-24 14:28:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2018-12-24 14:28:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-12-24 14:28:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-12-24 14:28:42,211 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2018-12-24 14:28:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:42,212 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-12-24 14:28:42,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-24 14:28:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-12-24 14:28:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-12-24 14:28:42,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:42,214 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2018-12-24 14:28:42,214 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2018-12-24 14:28:42,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:42,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:42,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:46,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:46,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:28:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:46,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:47,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:47,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:47,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:47,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:28:47,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:47,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:52,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:57,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:57,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2018-12-24 14:28:57,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:57,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-24 14:28:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-24 14:28:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 14:28:57,205 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2018-12-24 14:28:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:58,040 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-12-24 14:28:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 14:28:58,041 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2018-12-24 14:28:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:58,042 INFO L225 Difference]: With dead ends: 395 [2018-12-24 14:28:58,043 INFO L226 Difference]: Without dead ends: 394 [2018-12-24 14:28:58,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 14:28:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-24 14:28:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-12-24 14:28:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-24 14:28:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-12-24 14:28:58,049 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2018-12-24 14:28:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:58,049 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-12-24 14:28:58,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-24 14:28:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-12-24 14:28:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-12-24 14:28:58,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:58,051 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2018-12-24 14:28:58,051 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2018-12-24 14:28:58,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:58,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:58,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:58,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:58,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:02,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:02,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:02,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:02,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:02,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:02,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:29:02,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:02,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:02,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:02,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:29:02,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:02,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:08,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:13,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:13,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2018-12-24 14:29:13,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:13,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-24 14:29:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-24 14:29:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:29:13,031 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2018-12-24 14:29:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:13,877 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-12-24 14:29:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 14:29:13,878 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2018-12-24 14:29:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:13,880 INFO L225 Difference]: With dead ends: 399 [2018-12-24 14:29:13,880 INFO L226 Difference]: Without dead ends: 398 [2018-12-24 14:29:13,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:29:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-12-24 14:29:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-12-24 14:29:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-24 14:29:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-12-24 14:29:13,887 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2018-12-24 14:29:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:13,887 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-12-24 14:29:13,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-24 14:29:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-12-24 14:29:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-12-24 14:29:13,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:13,889 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2018-12-24 14:29:13,889 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2018-12-24 14:29:13,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:13,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:13,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:13,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:13,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:18,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:18,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:18,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:18,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:18,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:18,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:29:18,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:18,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:19,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-24 14:29:19,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:19,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:19,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:29:19,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:19,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:25,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:29,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:29,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2018-12-24 14:29:29,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:29,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-12-24 14:29:29,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-12-24 14:29:29,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 14:29:29,661 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2018-12-24 14:29:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:30,486 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-12-24 14:29:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 14:29:30,487 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2018-12-24 14:29:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:30,489 INFO L225 Difference]: With dead ends: 403 [2018-12-24 14:29:30,489 INFO L226 Difference]: Without dead ends: 402 [2018-12-24 14:29:30,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 14:29:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-24 14:29:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2018-12-24 14:29:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-12-24 14:29:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-12-24 14:29:30,496 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2018-12-24 14:29:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:30,497 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-12-24 14:29:30,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-12-24 14:29:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-12-24 14:29:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-12-24 14:29:30,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:30,499 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2018-12-24 14:29:30,499 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2018-12-24 14:29:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:30,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:30,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:35,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:35,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:35,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:35,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:35,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:35,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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:29:35,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:29:35,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:29:35,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:29:35,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:35,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:35,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:29:35,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:35,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:35,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:41,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:46,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:46,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2018-12-24 14:29:46,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:46,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-12-24 14:29:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-12-24 14:29:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:29:46,130 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2018-12-24 14:29:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:46,993 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-12-24 14:29:46,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 14:29:46,994 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2018-12-24 14:29:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:46,996 INFO L225 Difference]: With dead ends: 407 [2018-12-24 14:29:46,996 INFO L226 Difference]: Without dead ends: 406 [2018-12-24 14:29:46,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:29:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-24 14:29:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-12-24 14:29:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-24 14:29:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-12-24 14:29:47,004 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2018-12-24 14:29:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:47,004 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-12-24 14:29:47,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-12-24 14:29:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-12-24 14:29:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-12-24 14:29:47,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:47,006 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2018-12-24 14:29:47,006 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2018-12-24 14:29:47,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:47,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:47,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat