java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 16:54:27,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 16:54:27,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 16:54:27,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 16:54:27,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 16:54:27,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 16:54:27,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 16:54:27,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 16:54:27,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 16:54:27,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 16:54:27,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 16:54:27,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 16:54:27,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 16:54:27,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 16:54:27,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 16:54:27,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 16:54:27,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 16:54:27,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 16:54:27,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 16:54:27,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 16:54:27,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 16:54:27,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 16:54:27,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 16:54:27,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 16:54:27,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 16:54:27,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 16:54:27,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 16:54:27,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 16:54:27,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 16:54:27,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 16:54:27,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 16:54:27,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 16:54:27,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 16:54:27,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 16:54:27,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 16:54:27,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 16:54:27,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 16:54:27,993 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 16:54:27,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 16:54:27,994 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 16:54:27,995 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 16:54:27,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 16:54:27,995 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 16:54:27,995 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 16:54:27,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 16:54:27,996 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 16:54:27,996 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 16:54:27,996 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 16:54:27,996 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 16:54:27,996 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 16:54:27,997 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 16:54:27,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 16:54:27,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 16:54:27,998 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 16:54:27,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 16:54:27,998 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 16:54:27,998 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 16:54:27,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 16:54:27,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 16:54:27,999 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 16:54:27,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 16:54:27,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 16:54:28,000 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 16:54:28,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 16:54:28,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 16:54:28,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 16:54:28,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 16:54:28,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 16:54:28,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:28,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 16:54:28,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 16:54:28,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 16:54:28,002 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 16:54:28,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 16:54:28,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 16:54:28,002 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 16:54:28,002 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 16:54:28,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 16:54:28,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 16:54:28,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 16:54:28,059 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 16:54:28,060 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 16:54:28,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-31 16:54:28,061 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-31 16:54:28,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 16:54:28,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 16:54:28,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:28,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 16:54:28,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 16:54:28,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,142 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 16:54:28,142 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 16:54:28,142 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 16:54:28,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:28,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 16:54:28,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 16:54:28,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 16:54:28,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/1) ... [2019-01-31 16:54:28,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 16:54:28,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 16:54:28,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 16:54:28,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 16:54:28,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-31 16:54:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 16:54:28,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 16:54:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-31 16:54:28,595 INFO L278 CfgBuilder]: Using library mode [2019-01-31 16:54:28,595 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-31 16:54:28,596 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:28 BoogieIcfgContainer [2019-01-31 16:54:28,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 16:54:28,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 16:54:28,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 16:54:28,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 16:54:28,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:28" (1/2) ... [2019-01-31 16:54:28,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5120183e and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:54:28, skipping insertion in model container [2019-01-31 16:54:28,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:28" (2/2) ... [2019-01-31 16:54:28,605 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-31 16:54:28,615 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 16:54:28,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-31 16:54:28,644 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-31 16:54:28,677 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 16:54:28,677 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 16:54:28,677 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 16:54:28,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 16:54:28,678 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 16:54:28,678 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 16:54:28,678 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 16:54:28,678 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 16:54:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-31 16:54:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 16:54:28,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:28,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 16:54:28,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-31 16:54:28,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 16:54:28,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:28,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:29,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 16:54:29,003 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-31 16:54:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,163 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-31 16:54:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 16:54:29,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 16:54:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,177 INFO L225 Difference]: With dead ends: 20 [2019-01-31 16:54:29,177 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 16:54:29,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 16:54:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 16:54:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-31 16:54:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 16:54:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 16:54:29,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-31 16:54:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,217 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 16:54:29,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 16:54:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 16:54:29,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 16:54:29,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-31 16:54:29,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:29,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:29,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:29,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 16:54:29,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 16:54:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-31 16:54:29,539 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-31 16:54:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,794 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-31 16:54:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 16:54:29,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 16:54:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,798 INFO L225 Difference]: With dead ends: 17 [2019-01-31 16:54:29,798 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 16:54:29,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-31 16:54:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 16:54:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-31 16:54:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 16:54:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-31 16:54:29,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-31 16:54:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,812 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-31 16:54:29,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 16:54:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-31 16:54:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 16:54:29,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,814 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 16:54:29,814 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-31 16:54:29,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:29,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:29,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 16:54:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 16:54:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:29,873 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-31 16:54:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,897 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-31 16:54:29,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 16:54:29,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-31 16:54:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,901 INFO L225 Difference]: With dead ends: 18 [2019-01-31 16:54:29,901 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 16:54:29,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 16:54:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 16:54:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 16:54:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-31 16:54:29,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-31 16:54:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,908 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-31 16:54:29,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 16:54:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 16:54:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 16:54:29,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,909 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-31 16:54:29,909 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-31 16:54:29,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:29,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:30,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 16:54:30,044 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-31 16:54:30,074 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 16:54:30,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 16:54:30,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 16:54:30,209 INFO L272 AbstractInterpreter]: Visited 7 different actions 25 times. Merged at 6 different actions 18 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 16:54:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:30,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 16:54:30,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:30,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:30,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:30,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:30,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:30,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:30,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 16:54:30,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:30,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 16:54:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 16:54:30,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-31 16:54:30,859 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-31 16:54:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:31,097 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-31 16:54:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 16:54:31,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-31 16:54:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:31,098 INFO L225 Difference]: With dead ends: 20 [2019-01-31 16:54:31,098 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 16:54:31,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 16:54:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-31 16:54:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 16:54:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-31 16:54:31,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-31 16:54:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:31,105 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-31 16:54:31,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 16:54:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-31 16:54:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-31 16:54:31,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:31,106 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-31 16:54:31,106 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-31 16:54:31,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:31,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:31,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:31,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:31,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:31,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:31,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:31,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 16:54:31,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:31,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:31,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:31,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:31,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:31,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:31,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 16:54:31,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:31,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 16:54:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 16:54:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:31,832 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-31 16:54:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:32,035 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-31 16:54:32,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 16:54:32,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-31 16:54:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:32,039 INFO L225 Difference]: With dead ends: 25 [2019-01-31 16:54:32,039 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 16:54:32,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-31 16:54:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 16:54:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-31 16:54:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 16:54:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-31 16:54:32,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-31 16:54:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:32,046 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-31 16:54:32,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 16:54:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-31 16:54:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 16:54:32,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:32,047 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-31 16:54:32,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-31 16:54:32,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:32,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:32,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:32,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:32,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:32,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:32,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:32,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:32,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:32,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:32,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:32,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:32,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:32,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:32,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:32,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:32,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:32,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 16:54:32,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:32,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 16:54:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 16:54:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 16:54:32,526 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-31 16:54:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:32,789 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-31 16:54:32,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 16:54:32,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-31 16:54:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:32,791 INFO L225 Difference]: With dead ends: 30 [2019-01-31 16:54:32,792 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 16:54:32,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 16:54:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-31 16:54:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 16:54:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-31 16:54:32,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-31 16:54:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:32,798 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-31 16:54:32,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 16:54:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-31 16:54:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-31 16:54:32,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:32,799 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-31 16:54:32,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-31 16:54:32,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:32,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:33,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:33,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:33,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:33,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:33,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:33,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:33,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:33,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:33,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:33,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 16:54:33,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:33,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 16:54:33,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 16:54:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:33,323 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-31 16:54:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:33,577 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-31 16:54:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 16:54:33,579 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-31 16:54:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:33,580 INFO L225 Difference]: With dead ends: 35 [2019-01-31 16:54:33,580 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 16:54:33,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 16:54:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-31 16:54:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 16:54:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-31 16:54:33,587 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-31 16:54:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:33,588 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-31 16:54:33,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 16:54:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-31 16:54:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 16:54:33,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:33,589 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-31 16:54:33,590 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-31 16:54:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:33,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:33,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:33,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:33,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:33,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:33,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:33,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-31 16:54:33,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:33,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:33,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:33,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:33,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:33,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:34,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-31 16:54:34,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:34,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 16:54:34,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 16:54:34,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-31 16:54:34,148 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-31 16:54:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:34,695 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-31 16:54:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 16:54:34,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-31 16:54:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:34,697 INFO L225 Difference]: With dead ends: 40 [2019-01-31 16:54:34,697 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 16:54:34,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 16:54:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-31 16:54:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 16:54:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-31 16:54:34,704 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-31 16:54:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:34,704 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-31 16:54:34,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 16:54:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-31 16:54:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-31 16:54:34,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:34,705 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-31 16:54:34,705 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-31 16:54:34,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:34,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:35,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:35,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:35,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:35,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:35,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:35,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:35,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:35,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:35,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:35,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-31 16:54:35,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:35,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 16:54:35,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 16:54:35,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:35,584 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-31 16:54:35,896 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-31 16:54:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:36,241 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-31 16:54:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 16:54:36,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-31 16:54:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:36,243 INFO L225 Difference]: With dead ends: 45 [2019-01-31 16:54:36,243 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 16:54:36,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 16:54:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-31 16:54:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 16:54:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-31 16:54:36,252 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-31 16:54:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:36,252 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-31 16:54:36,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 16:54:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-31 16:54:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 16:54:36,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:36,254 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-31 16:54:36,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-31 16:54:36,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:36,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:36,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:36,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:36,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:36,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:36,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:36,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:36,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:36,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:36,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:37,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-31 16:54:37,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:37,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 16:54:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 16:54:37,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-31 16:54:37,067 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-31 16:54:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:37,355 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-31 16:54:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 16:54:37,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-31 16:54:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:37,357 INFO L225 Difference]: With dead ends: 50 [2019-01-31 16:54:37,357 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 16:54:37,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 16:54:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-31 16:54:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 16:54:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-31 16:54:37,366 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-31 16:54:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:37,367 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-31 16:54:37,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 16:54:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-31 16:54:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-31 16:54:37,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:37,368 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-31 16:54:37,368 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-31 16:54:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:38,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:38,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:38,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:38,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:38,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:38,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-31 16:54:38,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:38,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:38,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:38,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:38,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:38,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-31 16:54:38,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:38,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 16:54:38,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 16:54:38,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:38,619 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-31 16:54:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:38,958 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-31 16:54:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 16:54:38,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-31 16:54:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:38,960 INFO L225 Difference]: With dead ends: 55 [2019-01-31 16:54:38,960 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 16:54:38,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 16:54:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 16:54:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-31 16:54:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 16:54:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-31 16:54:38,968 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-31 16:54:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:38,969 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-31 16:54:38,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 16:54:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-31 16:54:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 16:54:38,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:38,970 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-31 16:54:38,970 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-31 16:54:38,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:38,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:39,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:39,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:39,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:39,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:39,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:39,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:39,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:39,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:39,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:39,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:39,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-31 16:54:39,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:39,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 16:54:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 16:54:39,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-31 16:54:39,936 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-31 16:54:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:40,323 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-31 16:54:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 16:54:40,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-31 16:54:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:40,326 INFO L225 Difference]: With dead ends: 60 [2019-01-31 16:54:40,326 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 16:54:40,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 16:54:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-31 16:54:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 16:54:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-31 16:54:40,336 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-31 16:54:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:40,337 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-31 16:54:40,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 16:54:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-31 16:54:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 16:54:40,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:40,338 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-31 16:54:40,338 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-31 16:54:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:40,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:40,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:40,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:40,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:40,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:40,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:40,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:40,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:40,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:40,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:41,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:41,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-31 16:54:41,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:41,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 16:54:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 16:54:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:41,292 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-31 16:54:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:41,798 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-31 16:54:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 16:54:41,799 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-31 16:54:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:41,800 INFO L225 Difference]: With dead ends: 65 [2019-01-31 16:54:41,800 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 16:54:41,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 16:54:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-31 16:54:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 16:54:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-31 16:54:41,812 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-31 16:54:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:41,812 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-31 16:54:41,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 16:54:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-31 16:54:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 16:54:41,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:41,813 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-31 16:54:41,814 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-31 16:54:41,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:41,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:42,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:42,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:42,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:42,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:42,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:42,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:42,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:42,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:42,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-31 16:54:42,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:42,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:42,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:42,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:42,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:42,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:42,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:42,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:42,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-31 16:54:42,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:42,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 16:54:42,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 16:54:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-31 16:54:42,620 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-31 16:54:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:43,269 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-31 16:54:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 16:54:43,269 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-31 16:54:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:43,270 INFO L225 Difference]: With dead ends: 70 [2019-01-31 16:54:43,270 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 16:54:43,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 16:54:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-31 16:54:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 16:54:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-31 16:54:43,283 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-31 16:54:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:43,283 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-31 16:54:43,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 16:54:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-31 16:54:43,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-31 16:54:43,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:43,284 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-31 16:54:43,285 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:43,285 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-31 16:54:43,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:43,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:43,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:43,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:43,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:43,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:43,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:43,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:43,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:43,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:43,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:43,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:43,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:43,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:43,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:43,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-31 16:54:44,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:44,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 16:54:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 16:54:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:44,553 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-31 16:54:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:45,169 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-31 16:54:45,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 16:54:45,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-31 16:54:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:45,171 INFO L225 Difference]: With dead ends: 75 [2019-01-31 16:54:45,171 INFO L226 Difference]: Without dead ends: 74 [2019-01-31 16:54:45,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-31 16:54:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-31 16:54:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 16:54:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-31 16:54:45,187 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-31 16:54:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:45,187 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-31 16:54:45,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 16:54:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-31 16:54:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 16:54:45,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:45,189 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-31 16:54:45,190 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-31 16:54:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:45,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:45,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:45,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:45,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:45,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:45,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:45,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:45,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:45,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:45,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:45,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:45,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:46,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-31 16:54:46,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:46,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 16:54:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 16:54:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-31 16:54:46,967 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-31 16:54:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:47,669 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-31 16:54:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 16:54:47,670 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-31 16:54:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:47,671 INFO L225 Difference]: With dead ends: 80 [2019-01-31 16:54:47,671 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 16:54:47,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 16:54:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-31 16:54:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 16:54:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-31 16:54:47,684 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-31 16:54:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:47,684 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-31 16:54:47,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 16:54:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-31 16:54:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-31 16:54:47,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:47,686 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-31 16:54:47,686 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-31 16:54:47,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:47,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:47,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:47,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:47,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:48,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:48,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:48,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:48,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:48,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:48,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:48,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:48,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-31 16:54:48,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:48,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:48,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:48,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:48,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:48,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:48,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:49,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:49,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-31 16:54:49,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:49,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 16:54:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 16:54:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:49,203 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-31 16:54:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:49,750 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-31 16:54:49,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 16:54:49,751 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-31 16:54:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:49,751 INFO L225 Difference]: With dead ends: 85 [2019-01-31 16:54:49,752 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 16:54:49,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 16:54:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-31 16:54:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 16:54:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-31 16:54:49,773 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-31 16:54:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:49,773 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-31 16:54:49,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 16:54:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-31 16:54:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 16:54:49,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:49,775 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-31 16:54:49,775 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-31 16:54:49,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:49,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:49,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:50,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:50,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:50,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:50,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:50,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:50,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:50,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:50,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:50,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:50,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:50,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:50,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:50,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:50,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:50,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:50,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:51,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:51,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-31 16:54:51,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:51,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 16:54:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 16:54:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-31 16:54:51,333 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-31 16:54:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:51,966 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-31 16:54:51,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 16:54:51,967 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-31 16:54:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:51,967 INFO L225 Difference]: With dead ends: 90 [2019-01-31 16:54:51,967 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 16:54:51,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 16:54:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-31 16:54:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-31 16:54:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-31 16:54:51,980 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-31 16:54:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:51,981 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-31 16:54:51,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 16:54:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-31 16:54:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-31 16:54:51,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:51,982 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-31 16:54:51,982 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-31 16:54:51,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:51,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:51,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:51,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:52,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:52,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:52,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:52,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:52,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:52,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:52,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:52,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:52,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:52,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:52,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:52,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:52,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:52,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:53,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:53,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-31 16:54:53,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:53,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 16:54:53,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 16:54:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:53,177 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-31 16:54:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:53,860 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-31 16:54:53,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 16:54:53,861 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-31 16:54:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:53,861 INFO L225 Difference]: With dead ends: 95 [2019-01-31 16:54:53,862 INFO L226 Difference]: Without dead ends: 94 [2019-01-31 16:54:53,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:54:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-31 16:54:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-31 16:54:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 16:54:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-31 16:54:53,873 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-31 16:54:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:53,873 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-31 16:54:53,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 16:54:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-31 16:54:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 16:54:53,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:53,873 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-31 16:54:53,874 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-31 16:54:53,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:53,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:54,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:54,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:54,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:54,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:54,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:54,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:54,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:54,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:54,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-31 16:54:54,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:54,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:54,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:54,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:54,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:54,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:54,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:55,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:55,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-31 16:54:55,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:55,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 16:54:55,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 16:54:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-31 16:54:55,473 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-31 16:54:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:56,115 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-31 16:54:56,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 16:54:56,116 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-31 16:54:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:56,116 INFO L225 Difference]: With dead ends: 100 [2019-01-31 16:54:56,116 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 16:54:56,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:54:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 16:54:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-31 16:54:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 16:54:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-31 16:54:56,127 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-31 16:54:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:56,128 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-31 16:54:56,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 16:54:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-31 16:54:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-31 16:54:56,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:56,129 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-31 16:54:56,129 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-31 16:54:56,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:56,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:56,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:56,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:56,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:56,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:56,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:56,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:56,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:56,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:56,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:56,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:56,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:56,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:56,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:56,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:56,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:56,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:57,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:57,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:57,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-31 16:54:57,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:57,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 16:54:57,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 16:54:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:57,706 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-31 16:54:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:58,467 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-31 16:54:58,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 16:54:58,468 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-31 16:54:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:58,468 INFO L225 Difference]: With dead ends: 105 [2019-01-31 16:54:58,468 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 16:54:58,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:54:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 16:54:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-31 16:54:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 16:54:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-31 16:54:58,483 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-31 16:54:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:58,483 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-31 16:54:58,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 16:54:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-31 16:54:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 16:54:58,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:58,484 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-31 16:54:58,484 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-31 16:54:58,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:58,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:58,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:58,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:58,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:58,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:58,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:58,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:58,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:58,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:58,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:59,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:59,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:59,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:59,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:59,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:59,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:00,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:00,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-31 16:55:00,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:00,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 16:55:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 16:55:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-31 16:55:00,064 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-31 16:55:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:00,823 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-31 16:55:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 16:55:00,824 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-31 16:55:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:00,826 INFO L225 Difference]: With dead ends: 110 [2019-01-31 16:55:00,826 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 16:55:00,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 16:55:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-31 16:55:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 16:55:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-31 16:55:00,838 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-31 16:55:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:00,839 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-31 16:55:00,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 16:55:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-31 16:55:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-31 16:55:00,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:00,839 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-31 16:55:00,840 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:00,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-31 16:55:00,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:00,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:00,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:00,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:00,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:01,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:01,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:01,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:01,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:01,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:01,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:01,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-31 16:55:01,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:01,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:01,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:01,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:01,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:01,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:01,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:02,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:02,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-31 16:55:02,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:02,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 16:55:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 16:55:02,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:55:02,764 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-31 16:55:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:03,762 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-31 16:55:03,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 16:55:03,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-31 16:55:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:03,763 INFO L225 Difference]: With dead ends: 115 [2019-01-31 16:55:03,763 INFO L226 Difference]: Without dead ends: 114 [2019-01-31 16:55:03,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-31 16:55:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-31 16:55:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 16:55:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-31 16:55:03,776 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-31 16:55:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:03,777 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-31 16:55:03,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 16:55:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-31 16:55:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 16:55:03,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:03,778 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-31 16:55:03,778 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:03,779 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-31 16:55:03,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:04,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:04,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:04,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:04,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:04,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:04,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:04,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:04,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:04,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:04,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:04,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:04,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:04,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:05,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-31 16:55:05,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:05,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 16:55:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 16:55:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-31 16:55:05,447 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-31 16:55:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:06,310 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-31 16:55:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 16:55:06,311 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-31 16:55:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:06,312 INFO L225 Difference]: With dead ends: 120 [2019-01-31 16:55:06,312 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 16:55:06,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 16:55:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-31 16:55:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-31 16:55:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-31 16:55:06,328 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-31 16:55:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:06,328 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-31 16:55:06,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 16:55:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-31 16:55:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-31 16:55:06,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:06,329 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-31 16:55:06,329 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-31 16:55:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:07,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:07,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:07,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:07,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:07,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:07,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:07,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:07,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:07,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:07,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:08,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:09,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:09,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-31 16:55:09,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:09,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 16:55:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 16:55:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:55:09,149 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-31 16:55:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:10,200 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-31 16:55:10,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 16:55:10,201 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-31 16:55:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:10,202 INFO L225 Difference]: With dead ends: 125 [2019-01-31 16:55:10,202 INFO L226 Difference]: Without dead ends: 124 [2019-01-31 16:55:10,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-31 16:55:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-31 16:55:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-31 16:55:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-31 16:55:10,222 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-31 16:55:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:10,222 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-31 16:55:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 16:55:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-31 16:55:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-31 16:55:10,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:10,224 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-31 16:55:10,224 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-31 16:55:10,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:10,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:10,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:10,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:10,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:10,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:10,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:10,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-31 16:55:10,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:10,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:10,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 [2019-01-31 16:55:10,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:10,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:10,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:11,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:12,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:12,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-31 16:55:12,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:12,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 16:55:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 16:55:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-31 16:55:12,268 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-31 16:55:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:13,253 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-31 16:55:13,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 16:55:13,254 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-31 16:55:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:13,255 INFO L225 Difference]: With dead ends: 130 [2019-01-31 16:55:13,255 INFO L226 Difference]: Without dead ends: 129 [2019-01-31 16:55:13,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-31 16:55:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-31 16:55:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-31 16:55:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-31 16:55:13,272 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-31 16:55:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:13,273 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-31 16:55:13,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 16:55:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-31 16:55:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-31 16:55:13,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:13,274 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-31 16:55:13,274 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-31 16:55:13,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:13,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:13,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:14,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:14,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:14,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:14,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:14,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:14,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:14,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:14,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:14,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:14,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:14,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:14,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:14,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:14,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:14,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:15,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:15,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-31 16:55:15,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:15,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 16:55:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 16:55:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:15,940 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-31 16:55:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:16,928 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-31 16:55:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 16:55:16,928 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-31 16:55:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:16,929 INFO L225 Difference]: With dead ends: 135 [2019-01-31 16:55:16,929 INFO L226 Difference]: Without dead ends: 134 [2019-01-31 16:55:16,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:55:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-31 16:55:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-31 16:55:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-31 16:55:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-31 16:55:16,949 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-31 16:55:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:16,949 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-31 16:55:16,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 16:55:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-31 16:55:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-31 16:55:16,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:16,950 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-31 16:55:16,950 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-31 16:55:16,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:16,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:16,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:16,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:16,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:17,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:17,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:17,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:17,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:17,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:17,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:17,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:17,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:17,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:17,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:17,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:17,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:17,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:18,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:19,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:19,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-31 16:55:19,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:19,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-31 16:55:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-31 16:55:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-31 16:55:19,472 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-31 16:55:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:20,569 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-31 16:55:20,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 16:55:20,570 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-31 16:55:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:20,570 INFO L225 Difference]: With dead ends: 140 [2019-01-31 16:55:20,571 INFO L226 Difference]: Without dead ends: 139 [2019-01-31 16:55:20,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:55:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-31 16:55:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-31 16:55:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-31 16:55:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-31 16:55:20,590 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-31 16:55:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:20,591 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-31 16:55:20,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-31 16:55:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-31 16:55:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-31 16:55:20,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:20,592 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-31 16:55:20,592 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-31 16:55:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:20,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:21,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:21,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:21,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:21,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:21,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:21,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:21,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:21,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:21,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-31 16:55:21,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:21,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:21,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:21,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:21,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:21,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:22,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:24,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:24,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-31 16:55:24,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:24,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 16:55:24,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 16:55:24,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:24,021 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-31 16:55:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:25,183 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-31 16:55:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 16:55:25,183 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-31 16:55:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:25,184 INFO L225 Difference]: With dead ends: 145 [2019-01-31 16:55:25,184 INFO L226 Difference]: Without dead ends: 144 [2019-01-31 16:55:25,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 16:55:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-31 16:55:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-31 16:55:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-31 16:55:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-31 16:55:25,203 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-31 16:55:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:25,203 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-31 16:55:25,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 16:55:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-31 16:55:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-31 16:55:25,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:25,204 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-31 16:55:25,204 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-31 16:55:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:25,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:25,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:25,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:25,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:25,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:25,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:25,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:25,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:25,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:25,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:26,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:26,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:26,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:26,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:26,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:26,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:26,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:26,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:27,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:27,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-31 16:55:27,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:27,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-31 16:55:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-31 16:55:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-31 16:55:27,979 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-31 16:55:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:29,348 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-31 16:55:29,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 16:55:29,349 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-31 16:55:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:29,350 INFO L225 Difference]: With dead ends: 150 [2019-01-31 16:55:29,350 INFO L226 Difference]: Without dead ends: 149 [2019-01-31 16:55:29,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:55:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-31 16:55:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-31 16:55:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-31 16:55:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-31 16:55:29,379 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-31 16:55:29,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:29,379 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-31 16:55:29,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-31 16:55:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-31 16:55:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-31 16:55:29,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:29,380 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-31 16:55:29,380 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-31 16:55:29,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:29,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:29,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:29,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:30,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:30,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:30,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:30,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:30,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:30,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:30,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:30,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:30,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:30,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:30,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:30,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:30,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:30,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:32,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:32,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-31 16:55:32,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:32,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-31 16:55:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-31 16:55:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:32,051 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-31 16:55:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:33,260 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-31 16:55:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 16:55:33,260 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-31 16:55:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:33,261 INFO L225 Difference]: With dead ends: 155 [2019-01-31 16:55:33,261 INFO L226 Difference]: Without dead ends: 154 [2019-01-31 16:55:33,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:55:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-31 16:55:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-31 16:55:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-31 16:55:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-31 16:55:33,280 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-31 16:55:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:33,281 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-31 16:55:33,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-31 16:55:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-31 16:55:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-31 16:55:33,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:33,282 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-31 16:55:33,282 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-31 16:55:33,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:33,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:33,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:34,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:34,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:34,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:34,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:34,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:34,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:34,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:34,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:34,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-31 16:55:34,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:34,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:34,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:34,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:34,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:34,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:36,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:37,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-31 16:55:37,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:37,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 16:55:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 16:55:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-31 16:55:37,365 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-31 16:55:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:38,632 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-31 16:55:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 16:55:38,632 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-31 16:55:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:38,633 INFO L225 Difference]: With dead ends: 160 [2019-01-31 16:55:38,633 INFO L226 Difference]: Without dead ends: 159 [2019-01-31 16:55:38,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:55:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-31 16:55:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-31 16:55:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-31 16:55:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-31 16:55:38,658 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-31 16:55:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:38,658 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-31 16:55:38,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 16:55:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-31 16:55:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-31 16:55:38,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:38,659 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-31 16:55:38,660 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-31 16:55:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:38,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:38,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:39,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:39,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:39,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:39,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:39,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:39,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:39,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:39,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:39,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:39,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:39,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:39,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:39,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:39,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:40,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:42,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:42,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-31 16:55:42,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:42,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-31 16:55:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-31 16:55:42,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:42,129 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-31 16:55:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:43,488 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-31 16:55:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 16:55:43,488 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-31 16:55:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:43,489 INFO L225 Difference]: With dead ends: 165 [2019-01-31 16:55:43,489 INFO L226 Difference]: Without dead ends: 164 [2019-01-31 16:55:43,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 16:55:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-31 16:55:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-31 16:55:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-31 16:55:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-31 16:55:43,516 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-31 16:55:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:43,517 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-31 16:55:43,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-31 16:55:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-31 16:55:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-31 16:55:43,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:43,518 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-31 16:55:43,518 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-31 16:55:43,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:43,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:43,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:44,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:44,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:44,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:44,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:44,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:44,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:44,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:44,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:44,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:44,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:44,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:44,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:44,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:45,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:46,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:46,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-31 16:55:46,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:46,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-31 16:55:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-31 16:55:46,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-31 16:55:46,700 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-31 16:55:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:48,623 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-31 16:55:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 16:55:48,623 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-31 16:55:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:48,625 INFO L225 Difference]: With dead ends: 170 [2019-01-31 16:55:48,625 INFO L226 Difference]: Without dead ends: 169 [2019-01-31 16:55:48,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:55:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-31 16:55:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-31 16:55:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-31 16:55:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-31 16:55:48,651 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-31 16:55:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:48,652 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-31 16:55:48,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-31 16:55:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-31 16:55:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-31 16:55:48,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:48,653 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-31 16:55:48,653 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-31 16:55:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:48,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:49,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:49,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:49,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:49,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:49,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:49,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:49,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:49,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-31 16:55:49,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:49,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:49,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:49,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:49,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:49,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:50,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:52,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:52,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-31 16:55:52,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:52,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 16:55:52,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 16:55:52,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:55:52,761 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-31 16:55:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:54,190 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-31 16:55:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 16:55:54,190 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-31 16:55:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:54,191 INFO L225 Difference]: With dead ends: 175 [2019-01-31 16:55:54,191 INFO L226 Difference]: Without dead ends: 174 [2019-01-31 16:55:54,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 16:55:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-31 16:55:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-31 16:55:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-31 16:55:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-31 16:55:54,227 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-31 16:55:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:54,228 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-31 16:55:54,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 16:55:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-31 16:55:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-31 16:55:54,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:54,229 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-31 16:55:54,229 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-31 16:55:54,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:54,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:54,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:54,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:54,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:55,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:55,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:55,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:55,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:55,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:55,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:55,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:55,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:55,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:55,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:55,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:55,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:55,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:55,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:55,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:56,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:58,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-31 16:55:58,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:58,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-31 16:55:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-31 16:55:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-31 16:55:58,007 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-31 16:56:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:00,079 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-31 16:56:00,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 16:56:00,079 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-31 16:56:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:00,080 INFO L225 Difference]: With dead ends: 180 [2019-01-31 16:56:00,080 INFO L226 Difference]: Without dead ends: 179 [2019-01-31 16:56:00,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:56:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-31 16:56:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-31 16:56:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-31 16:56:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-31 16:56:00,108 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-31 16:56:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:00,109 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-31 16:56:00,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-31 16:56:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-31 16:56:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-31 16:56:00,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:00,110 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-31 16:56:00,110 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-31 16:56:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:00,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:00,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:00,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:00,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:00,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:00,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:00,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:00,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:00,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:00,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:01,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:01,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:01,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:01,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:01,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:02,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:03,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:03,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-31 16:56:03,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:03,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 16:56:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 16:56:03,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:56:03,796 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-31 16:56:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:05,550 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-31 16:56:05,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 16:56:05,551 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-31 16:56:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:05,552 INFO L225 Difference]: With dead ends: 185 [2019-01-31 16:56:05,552 INFO L226 Difference]: Without dead ends: 184 [2019-01-31 16:56:05,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:56:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-31 16:56:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-31 16:56:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-31 16:56:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-31 16:56:05,587 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-31 16:56:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:05,587 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-31 16:56:05,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 16:56:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-31 16:56:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-31 16:56:05,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:05,588 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-31 16:56:05,589 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-31 16:56:05,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:05,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:05,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:05,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:05,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:06,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:06,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:06,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:06,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:06,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:06,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:06,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:06,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:06,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-31 16:56:06,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:06,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:06,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:06,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:06,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:06,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:07,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:09,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:09,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-31 16:56:09,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:09,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 16:56:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 16:56:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-31 16:56:09,683 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-31 16:56:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:11,494 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-31 16:56:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 16:56:11,494 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-31 16:56:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:11,495 INFO L225 Difference]: With dead ends: 190 [2019-01-31 16:56:11,495 INFO L226 Difference]: Without dead ends: 189 [2019-01-31 16:56:11,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:56:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-31 16:56:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-31 16:56:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-31 16:56:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-31 16:56:11,523 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-31 16:56:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:11,523 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-31 16:56:11,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 16:56:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-31 16:56:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-31 16:56:11,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:11,524 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-31 16:56:11,524 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-31 16:56:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:11,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:11,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:12,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:12,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:12,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:12,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:12,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:12,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:12,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:12,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:12,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:12,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:12,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:12,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:12,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:12,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:12,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:14,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:16,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-31 16:56:16,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:16,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-31 16:56:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-31 16:56:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 16:56:16,896 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-31 16:56:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:18,676 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-31 16:56:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 16:56:18,676 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-31 16:56:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:18,677 INFO L225 Difference]: With dead ends: 195 [2019-01-31 16:56:18,677 INFO L226 Difference]: Without dead ends: 194 [2019-01-31 16:56:18,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 16:56:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-31 16:56:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-31 16:56:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-31 16:56:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-31 16:56:18,714 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-31 16:56:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:18,715 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-31 16:56:18,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-31 16:56:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-31 16:56:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-31 16:56:18,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:18,716 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-31 16:56:18,716 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-31 16:56:18,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:18,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:18,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:18,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:18,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:19,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:19,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:19,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:19,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:19,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:19,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:19,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:19,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:19,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:19,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 [2019-01-31 16:56:19,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:19,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:19,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:20,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:22,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:22,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-31 16:56:22,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:22,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 16:56:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 16:56:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-31 16:56:22,943 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-31 16:56:23,507 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 16:56:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:25,312 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-31 16:56:25,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 16:56:25,313 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-31 16:56:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:25,314 INFO L225 Difference]: With dead ends: 200 [2019-01-31 16:56:25,314 INFO L226 Difference]: Without dead ends: 199 [2019-01-31 16:56:25,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:56:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-31 16:56:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-31 16:56:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-31 16:56:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-31 16:56:25,349 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-31 16:56:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:25,349 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-31 16:56:25,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 16:56:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-31 16:56:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-31 16:56:25,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:25,350 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-31 16:56:25,350 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-31 16:56:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:25,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:26,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:26,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:26,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:26,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:26,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:26,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:26,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:26,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:26,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-31 16:56:26,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:26,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:26,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:26,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:26,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:26,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:27,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:29,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:29,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-31 16:56:29,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:29,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 16:56:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 16:56:29,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:56:29,792 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-31 16:56:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:31,954 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-31 16:56:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 16:56:31,954 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-31 16:56:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:31,955 INFO L225 Difference]: With dead ends: 205 [2019-01-31 16:56:31,955 INFO L226 Difference]: Without dead ends: 204 [2019-01-31 16:56:31,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:56:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-31 16:56:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-31 16:56:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-31 16:56:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-31 16:56:31,985 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-31 16:56:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:31,985 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-31 16:56:31,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 16:56:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-31 16:56:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-31 16:56:31,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:31,986 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-31 16:56:31,986 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-31 16:56:31,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:31,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:31,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:33,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:33,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:33,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:33,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:33,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:33,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:33,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:33,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:33,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:33,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:33,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:33,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:33,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:33,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:33,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:34,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:36,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-31 16:56:36,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:36,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-31 16:56:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-31 16:56:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-31 16:56:36,707 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-31 16:56:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:38,616 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-31 16:56:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 16:56:38,616 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-31 16:56:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:38,617 INFO L225 Difference]: With dead ends: 210 [2019-01-31 16:56:38,617 INFO L226 Difference]: Without dead ends: 209 [2019-01-31 16:56:38,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 16:56:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-31 16:56:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-31 16:56:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-31 16:56:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-31 16:56:38,654 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-31 16:56:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:38,654 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-31 16:56:38,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-31 16:56:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-31 16:56:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-31 16:56:38,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:38,655 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-31 16:56:38,655 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-31 16:56:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:38,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:38,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:38,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:38,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:40,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:40,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:40,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:40,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:40,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:40,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:40,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:40,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:40,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:40,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:40,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:40,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:40,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:41,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:44,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:44,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-31 16:56:44,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:44,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 16:56:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 16:56:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 16:56:44,005 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-31 16:56:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:46,174 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-31 16:56:46,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 16:56:46,174 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-31 16:56:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:46,175 INFO L225 Difference]: With dead ends: 215 [2019-01-31 16:56:46,175 INFO L226 Difference]: Without dead ends: 214 [2019-01-31 16:56:46,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 16:56:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-31 16:56:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-31 16:56:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-31 16:56:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-31 16:56:46,224 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-31 16:56:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:46,224 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-31 16:56:46,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 16:56:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-31 16:56:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-31 16:56:46,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:46,226 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-31 16:56:46,226 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-31 16:56:46,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:46,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:46,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:46,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:46,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:47,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:47,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:47,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:47,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:47,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:47,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:47,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:47,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-31 16:56:47,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:48,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:48,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:48,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:48,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:48,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:49,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:51,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:51,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-31 16:56:51,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:51,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 16:56:51,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 16:56:51,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-31 16:56:51,986 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-31 16:56:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:54,089 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-31 16:56:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 16:56:54,090 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-31 16:56:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:54,091 INFO L225 Difference]: With dead ends: 220 [2019-01-31 16:56:54,091 INFO L226 Difference]: Without dead ends: 219 [2019-01-31 16:56:54,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 16:56:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-31 16:56:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-31 16:56:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-31 16:56:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-31 16:56:54,135 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-31 16:56:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:54,135 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-31 16:56:54,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 16:56:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-31 16:56:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-31 16:56:54,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:54,136 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-31 16:56:54,136 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-31 16:56:54,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:54,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:54,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:54,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:55,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:55,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:55,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:55,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:55,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:55,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:55,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:55,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:55,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:55,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:55,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:55,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:55,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:55,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:55,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:57,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:00,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:00,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-31 16:57:00,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:00,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-31 16:57:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-31 16:57:00,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:00,012 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-31 16:57:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:02,415 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-31 16:57:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 16:57:02,415 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-31 16:57:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:02,416 INFO L225 Difference]: With dead ends: 225 [2019-01-31 16:57:02,416 INFO L226 Difference]: Without dead ends: 224 [2019-01-31 16:57:02,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 16:57:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-31 16:57:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-31 16:57:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 16:57:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-31 16:57:02,454 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-31 16:57:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:02,454 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-31 16:57:02,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-31 16:57:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-31 16:57:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-31 16:57:02,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:02,455 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-31 16:57:02,455 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:02,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-31 16:57:02,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:02,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:02,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:02,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:02,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:03,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:03,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:03,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:03,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:03,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:03,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:03,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:03,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:03,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:03,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:03,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:03,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:03,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:05,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:07,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:07,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-31 16:57:07,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:07,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 16:57:07,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 16:57:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-31 16:57:07,927 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-31 16:57:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:10,386 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-31 16:57:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 16:57:10,387 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-31 16:57:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:10,388 INFO L225 Difference]: With dead ends: 230 [2019-01-31 16:57:10,388 INFO L226 Difference]: Without dead ends: 229 [2019-01-31 16:57:10,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 16:57:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-31 16:57:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-31 16:57:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-31 16:57:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-31 16:57:10,436 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-31 16:57:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:10,436 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-31 16:57:10,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 16:57:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-31 16:57:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-31 16:57:10,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:10,437 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-31 16:57:10,438 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:10,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:10,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-31 16:57:10,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:10,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:10,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:11,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:11,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:11,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:11,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:11,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:11,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:11,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:11,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:12,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-31 16:57:12,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:12,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:12,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:12,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:12,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:12,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:13,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:16,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:16,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-31 16:57:16,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:16,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 16:57:16,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 16:57:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 16:57:16,768 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-31 16:57:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:19,223 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-31 16:57:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 16:57:19,223 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-31 16:57:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:19,224 INFO L225 Difference]: With dead ends: 235 [2019-01-31 16:57:19,225 INFO L226 Difference]: Without dead ends: 234 [2019-01-31 16:57:19,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 16:57:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-31 16:57:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-31 16:57:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-31 16:57:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-31 16:57:19,284 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-31 16:57:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:19,284 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-31 16:57:19,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 16:57:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-31 16:57:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-31 16:57:19,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:19,286 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-31 16:57:19,286 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-31 16:57:19,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:19,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:19,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:20,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:20,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:20,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:20,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:20,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:20,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:20,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:20,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:20,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:20,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:20,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:20,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:20,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:20,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:20,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:22,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:25,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:25,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-31 16:57:25,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:25,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-31 16:57:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-31 16:57:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-31 16:57:25,403 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-31 16:57:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:27,986 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-31 16:57:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 16:57:27,986 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-31 16:57:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:27,988 INFO L225 Difference]: With dead ends: 240 [2019-01-31 16:57:27,988 INFO L226 Difference]: Without dead ends: 239 [2019-01-31 16:57:27,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 16:57:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-31 16:57:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-31 16:57:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-31 16:57:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-31 16:57:28,047 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-31 16:57:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:28,047 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-31 16:57:28,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-31 16:57:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-31 16:57:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-31 16:57:28,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:28,049 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-31 16:57:28,049 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-31 16:57:28,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:28,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:28,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:28,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:28,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:29,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:29,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:29,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:29,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:29,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:29,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:29,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:29,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:29,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:29,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:29,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:29,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:29,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:30,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-31 16:57:34,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:34,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-31 16:57:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-31 16:57:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:57:34,370 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-31 16:57:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:37,056 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-31 16:57:37,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 16:57:37,062 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-31 16:57:37,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:37,063 INFO L225 Difference]: With dead ends: 245 [2019-01-31 16:57:37,063 INFO L226 Difference]: Without dead ends: 244 [2019-01-31 16:57:37,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 16:57:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-31 16:57:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-31 16:57:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-31 16:57:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-31 16:57:37,119 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-31 16:57:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-31 16:57:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-31 16:57:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-31 16:57:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-31 16:57:37,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:37,120 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-31 16:57:37,120 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-31 16:57:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:37,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:37,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:38,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:38,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:38,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:38,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:38,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:38,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:38,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:38,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-31 16:57:38,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:38,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:38,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:38,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:38,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:38,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:40,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:43,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:43,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-31 16:57:43,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:43,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 16:57:43,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 16:57:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-31 16:57:43,764 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-31 16:57:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:46,384 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-31 16:57:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 16:57:46,384 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-31 16:57:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:46,386 INFO L225 Difference]: With dead ends: 250 [2019-01-31 16:57:46,386 INFO L226 Difference]: Without dead ends: 249 [2019-01-31 16:57:46,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 16:57:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-31 16:57:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-31 16:57:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-31 16:57:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-31 16:57:46,442 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-31 16:57:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:46,443 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-31 16:57:46,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 16:57:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-31 16:57:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-31 16:57:46,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:46,444 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-31 16:57:46,444 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-31 16:57:46,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:46,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:46,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:46,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:46,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:48,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:48,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:48,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:48,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:48,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:48,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:48,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:48,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:48,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:48,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:48,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:48,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:48,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:48,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:48,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:49,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:53,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:53,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-31 16:57:53,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:53,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-31 16:57:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-31 16:57:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 16:57:53,570 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-31 16:57:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:56,262 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-31 16:57:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 16:57:56,263 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-31 16:57:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:56,264 INFO L225 Difference]: With dead ends: 255 [2019-01-31 16:57:56,264 INFO L226 Difference]: Without dead ends: 254 [2019-01-31 16:57:56,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 16:57:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-31 16:57:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-31 16:57:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-31 16:57:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-31 16:57:56,335 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-31 16:57:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:56,335 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-31 16:57:56,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-31 16:57:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-31 16:57:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-31 16:57:56,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:56,337 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-31 16:57:56,337 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-31 16:57:56,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:56,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:56,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:58,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:58,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:58,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:58,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:58,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:58,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:58,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:58,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:58,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:58,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:58,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:58,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:58,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:59,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:03,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:03,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-31 16:58:03,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:03,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-31 16:58:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-31 16:58:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-31 16:58:03,738 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-31 16:58:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:06,542 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-31 16:58:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 16:58:06,542 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-31 16:58:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:06,544 INFO L225 Difference]: With dead ends: 260 [2019-01-31 16:58:06,544 INFO L226 Difference]: Without dead ends: 259 [2019-01-31 16:58:06,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 16:58:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-31 16:58:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-31 16:58:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-31 16:58:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-31 16:58:06,602 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-31 16:58:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:06,602 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-31 16:58:06,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-31 16:58:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-31 16:58:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-31 16:58:06,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:06,604 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-31 16:58:06,604 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:06,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-31 16:58:06,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:06,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:08,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:08,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:08,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:08,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:08,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:08,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:08,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:08,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:08,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-31 16:58:08,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:08,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:08,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:08,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:08,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:08,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:10,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:14,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-31 16:58:14,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:14,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 16:58:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 16:58:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 16:58:14,107 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-31 16:58:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:16,945 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-31 16:58:16,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 16:58:16,946 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-31 16:58:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:16,947 INFO L225 Difference]: With dead ends: 265 [2019-01-31 16:58:16,947 INFO L226 Difference]: Without dead ends: 264 [2019-01-31 16:58:16,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 16:58:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-31 16:58:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-31 16:58:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-31 16:58:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-31 16:58:16,994 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-31 16:58:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-31 16:58:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 16:58:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-31 16:58:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-31 16:58:16,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:16,996 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-31 16:58:16,996 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-31 16:58:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:16,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:16,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:18,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:18,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:18,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:18,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:18,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:18,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:18,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:18,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:18,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:18,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:18,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:18,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:18,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:18,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:20,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:24,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-31 16:58:24,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:24,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-31 16:58:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-31 16:58:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-31 16:58:24,389 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-31 16:58:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:27,359 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-31 16:58:27,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 16:58:27,359 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-31 16:58:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:27,360 INFO L225 Difference]: With dead ends: 270 [2019-01-31 16:58:27,360 INFO L226 Difference]: Without dead ends: 269 [2019-01-31 16:58:27,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 16:58:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-31 16:58:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-31 16:58:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-31 16:58:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-31 16:58:27,420 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-31 16:58:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:27,420 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-31 16:58:27,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-31 16:58:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-31 16:58:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-31 16:58:27,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:27,421 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-31 16:58:27,421 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:27,422 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-31 16:58:27,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:27,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:27,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:27,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:27,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:29,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:29,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:29,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:29,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:29,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:29,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:29,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:29,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:29,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:29,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:29,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:29,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:31,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:35,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-31 16:58:35,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:35,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-31 16:58:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-31 16:58:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:58:35,763 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-31 16:58:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:38,950 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-31 16:58:38,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 16:58:38,951 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-31 16:58:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:38,952 INFO L225 Difference]: With dead ends: 275 [2019-01-31 16:58:38,952 INFO L226 Difference]: Without dead ends: 274 [2019-01-31 16:58:38,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 16:58:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-31 16:58:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-31 16:58:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-31 16:58:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-31 16:58:39,004 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-31 16:58:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:39,004 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-31 16:58:39,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-31 16:58:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-31 16:58:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-31 16:58:39,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:39,006 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-31 16:58:39,006 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-31 16:58:39,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:39,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:40,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:40,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:40,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:40,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:40,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:40,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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:40,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:40,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:41,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-31 16:58:41,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:41,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:41,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:41,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:41,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:41,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:43,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:46,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:46,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-31 16:58:46,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:46,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-31 16:58:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-31 16:58:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-31 16:58:46,970 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-31 16:58:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:50,287 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-31 16:58:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 16:58:50,287 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-31 16:58:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:50,288 INFO L225 Difference]: With dead ends: 280 [2019-01-31 16:58:50,289 INFO L226 Difference]: Without dead ends: 279 [2019-01-31 16:58:50,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 16:58:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-31 16:58:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-31 16:58:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-31 16:58:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-31 16:58:50,350 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-31 16:58:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:50,350 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-31 16:58:50,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-31 16:58:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-31 16:58:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-31 16:58:50,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:50,352 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-31 16:58:50,352 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-31 16:58:50,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:50,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:50,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:51,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:51,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:51,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:51,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:51,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:51,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:51,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:51,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:52,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:52,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:52,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:52,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:52,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:52,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:52,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:54,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-31 16:58:58,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:58,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-31 16:58:58,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-31 16:58:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 16:58:58,023 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-31 16:59:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:01,354 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-31 16:59:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 16:59:01,354 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-31 16:59:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:01,355 INFO L225 Difference]: With dead ends: 285 [2019-01-31 16:59:01,355 INFO L226 Difference]: Without dead ends: 284 [2019-01-31 16:59:01,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 16:59:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-31 16:59:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-31 16:59:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-31 16:59:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-31 16:59:01,411 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-31 16:59:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:01,411 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-31 16:59:01,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-31 16:59:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-31 16:59:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-31 16:59:01,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:01,412 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-31 16:59:01,413 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-31 16:59:01,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:01,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:01,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:03,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:03,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:03,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:03,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:03,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:03,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:03,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:03,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:03,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:03,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:03,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:03,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:05,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:09,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:09,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-31 16:59:09,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:09,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-31 16:59:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-31 16:59:09,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-31 16:59:09,591 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-31 16:59:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:12,898 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-31 16:59:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 16:59:12,898 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-31 16:59:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:12,899 INFO L225 Difference]: With dead ends: 290 [2019-01-31 16:59:12,899 INFO L226 Difference]: Without dead ends: 289 [2019-01-31 16:59:12,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 16:59:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-31 16:59:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-31 16:59:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-31 16:59:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-31 16:59:12,955 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-31 16:59:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:12,956 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-31 16:59:12,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-31 16:59:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-31 16:59:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-31 16:59:12,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:12,957 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-31 16:59:12,957 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-31 16:59:12,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:12,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:14,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:14,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:14,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:14,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:14,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:14,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:14,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:14,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:15,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-31 16:59:15,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:15,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:15,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:15,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:15,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:15,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:17,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:21,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:21,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-31 16:59:21,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:21,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-31 16:59:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-31 16:59:21,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:59:21,601 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-31 16:59:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:25,183 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-31 16:59:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 16:59:25,184 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-31 16:59:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:25,185 INFO L225 Difference]: With dead ends: 295 [2019-01-31 16:59:25,185 INFO L226 Difference]: Without dead ends: 294 [2019-01-31 16:59:25,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 16:59:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-31 16:59:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-31 16:59:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-31 16:59:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-31 16:59:25,250 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-31 16:59:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:25,250 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-31 16:59:25,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-31 16:59:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-31 16:59:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-31 16:59:25,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:25,251 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-31 16:59:25,251 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:25,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-31 16:59:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:25,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:25,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:25,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:25,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:27,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:27,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:27,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:27,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:27,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:27,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:27,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:27,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:27,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:27,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:27,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:27,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:27,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:27,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:29,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:33,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:33,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-31 16:59:33,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:33,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-31 16:59:33,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-31 16:59:33,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-31 16:59:33,389 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-31 16:59:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:36,963 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-31 16:59:36,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 16:59:36,964 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-31 16:59:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:36,965 INFO L225 Difference]: With dead ends: 300 [2019-01-31 16:59:36,965 INFO L226 Difference]: Without dead ends: 299 [2019-01-31 16:59:36,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 16:59:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-31 16:59:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-31 16:59:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-31 16:59:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-31 16:59:37,036 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-31 16:59:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:37,037 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-31 16:59:37,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-31 16:59:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-31 16:59:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-31 16:59:37,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:37,038 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-31 16:59:37,039 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-31 16:59:37,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:37,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:37,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:37,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:37,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:38,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:38,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:38,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:38,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:38,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:38,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:38,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:38,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:39,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:39,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:39,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:39,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:41,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:45,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:45,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-31 16:59:45,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:45,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-31 16:59:45,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-31 16:59:45,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 16:59:45,709 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-31 16:59:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:49,286 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-31 16:59:49,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 16:59:49,287 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-31 16:59:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:49,288 INFO L225 Difference]: With dead ends: 305 [2019-01-31 16:59:49,288 INFO L226 Difference]: Without dead ends: 304 [2019-01-31 16:59:49,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 16:59:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-31 16:59:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-31 16:59:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-31 16:59:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-31 16:59:49,352 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-31 16:59:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:49,352 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-31 16:59:49,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-31 16:59:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-31 16:59:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-31 16:59:49,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:49,354 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-31 16:59:49,354 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-31 16:59:49,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:49,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:49,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:51,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:51,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:51,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:51,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:51,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:51,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:51,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:51,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:51,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-31 16:59:51,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:52,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:52,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:52,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:52,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:52,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:54,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-31 16:59:58,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:58,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-31 16:59:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-31 16:59:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-31 16:59:58,171 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-31 17:00:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:01,966 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-31 17:00:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 17:00:01,966 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-31 17:00:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:01,967 INFO L225 Difference]: With dead ends: 310 [2019-01-31 17:00:01,967 INFO L226 Difference]: Without dead ends: 309 [2019-01-31 17:00:01,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-31 17:00:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-31 17:00:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-31 17:00:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-31 17:00:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-31 17:00:02,033 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-31 17:00:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:02,034 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-31 17:00:02,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-31 17:00:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-31 17:00:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-31 17:00:02,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:02,035 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-31 17:00:02,035 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:02,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-31 17:00:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:02,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:02,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:03,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:03,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:03,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:03,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:03,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:03,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:03,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:03,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:04,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:04,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:04,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:04,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:04,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:04,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:04,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:06,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:10,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:10,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-31 17:00:10,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-31 17:00:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-31 17:00:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:00:10,631 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-31 17:00:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:14,480 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-31 17:00:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 17:00:14,480 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-31 17:00:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:14,481 INFO L225 Difference]: With dead ends: 315 [2019-01-31 17:00:14,481 INFO L226 Difference]: Without dead ends: 314 [2019-01-31 17:00:14,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-31 17:00:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-31 17:00:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-31 17:00:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-31 17:00:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-31 17:00:14,557 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-31 17:00:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:14,557 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-31 17:00:14,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-31 17:00:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-31 17:00:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-31 17:00:14,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:14,558 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-31 17:00:14,559 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-31 17:00:14,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:14,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:14,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:14,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:14,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:16,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:16,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:16,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:16,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:16,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:16,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:16,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:16,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:16,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:16,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:16,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:16,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:17,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:19,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:23,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:23,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-31 17:00:23,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:23,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-31 17:00:23,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-31 17:00:23,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-31 17:00:23,599 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-31 17:00:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:27,688 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-31 17:00:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 17:00:27,689 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-31 17:00:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:27,690 INFO L225 Difference]: With dead ends: 320 [2019-01-31 17:00:27,690 INFO L226 Difference]: Without dead ends: 319 [2019-01-31 17:00:27,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-31 17:00:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-31 17:00:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-31 17:00:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-31 17:00:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-31 17:00:27,781 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-31 17:00:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:27,781 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-31 17:00:27,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-31 17:00:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-31 17:00:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-31 17:00:27,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:27,783 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-31 17:00:27,783 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-31 17:00:27,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:27,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:29,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:29,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:29,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:29,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:29,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:29,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:29,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:29,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:30,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-31 17:00:30,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:30,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:30,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:30,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:30,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:30,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:33,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:37,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:37,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-31 17:00:37,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:37,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-31 17:00:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-31 17:00:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 17:00:37,186 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-31 17:00:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:41,079 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-31 17:00:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 17:00:41,079 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-31 17:00:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:41,080 INFO L225 Difference]: With dead ends: 325 [2019-01-31 17:00:41,081 INFO L226 Difference]: Without dead ends: 324 [2019-01-31 17:00:41,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-31 17:00:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-31 17:00:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-31 17:00:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-31 17:00:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-31 17:00:41,154 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-31 17:00:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:41,155 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-31 17:00:41,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-31 17:00:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-31 17:00:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-31 17:00:41,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:41,156 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-31 17:00:41,156 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-31 17:00:41,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:41,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:41,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:43,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:43,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:43,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:43,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:43,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:43,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:43,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:43,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:43,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:43,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:43,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:43,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:43,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:46,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-31 17:00:50,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:50,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-31 17:00:50,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-31 17:00:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-31 17:00:50,752 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-31 17:00:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:55,120 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-31 17:00:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 17:00:55,120 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-31 17:00:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:55,121 INFO L225 Difference]: With dead ends: 330 [2019-01-31 17:00:55,121 INFO L226 Difference]: Without dead ends: 329 [2019-01-31 17:00:55,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-31 17:00:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-31 17:00:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-31 17:00:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-31 17:00:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-31 17:00:55,199 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-31 17:00:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:55,199 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-31 17:00:55,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-31 17:00:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-31 17:00:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-31 17:00:55,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:55,201 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-31 17:00:55,201 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-31 17:00:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:55,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:55,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:57,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:57,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:57,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:57,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:57,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:57,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:57,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:57,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:57,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:57,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 [2019-01-31 17:00:57,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:57,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:57,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:00,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:04,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:04,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-31 17:01:04,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:04,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-31 17:01:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-31 17:01:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 17:01:04,787 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-31 17:01:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:09,224 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-31 17:01:09,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 17:01:09,225 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-31 17:01:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:09,226 INFO L225 Difference]: With dead ends: 335 [2019-01-31 17:01:09,226 INFO L226 Difference]: Without dead ends: 334 [2019-01-31 17:01:09,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-31 17:01:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-31 17:01:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-31 17:01:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-31 17:01:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-31 17:01:09,302 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-31 17:01:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:09,303 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-31 17:01:09,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-31 17:01:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-31 17:01:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-31 17:01:09,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:09,304 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-31 17:01:09,304 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-31 17:01:09,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:09,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:09,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:11,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:11,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:11,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:11,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:11,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:11,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:11,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:11,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:12,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-31 17:01:12,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:12,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:12,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:12,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:12,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:12,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:14,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:20,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:20,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-31 17:01:20,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:20,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-31 17:01:20,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-31 17:01:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-31 17:01:20,681 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-31 17:01:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:25,126 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-31 17:01:25,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 17:01:25,126 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-31 17:01:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:25,128 INFO L225 Difference]: With dead ends: 340 [2019-01-31 17:01:25,128 INFO L226 Difference]: Without dead ends: 339 [2019-01-31 17:01:25,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-31 17:01:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-31 17:01:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-31 17:01:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-31 17:01:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-31 17:01:25,209 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-31 17:01:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:25,209 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-31 17:01:25,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-31 17:01:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-31 17:01:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-31 17:01:25,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:25,211 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-31 17:01:25,211 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-31 17:01:25,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:25,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:25,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:27,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:27,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:27,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:27,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:27,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:27,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:27,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:27,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:27,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:27,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:27,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 [2019-01-31 17:01:27,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:27,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:27,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:30,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-31 17:01:34,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:34,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-31 17:01:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-31 17:01:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:01:34,877 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-31 17:01:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:39,538 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-31 17:01:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 17:01:39,539 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-31 17:01:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:39,540 INFO L225 Difference]: With dead ends: 345 [2019-01-31 17:01:39,540 INFO L226 Difference]: Without dead ends: 344 [2019-01-31 17:01:39,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-31 17:01:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-31 17:01:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-31 17:01:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-31 17:01:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-31 17:01:39,638 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-31 17:01:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:39,639 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-31 17:01:39,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-31 17:01:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-31 17:01:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-31 17:01:39,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:39,640 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-31 17:01:39,640 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-31 17:01:39,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:39,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:39,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:41,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:41,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:41,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:41,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:41,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:41,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:41,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:41,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:01:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:42,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:42,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:42,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:42,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:42,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:45,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:49,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-31 17:01:49,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:49,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-31 17:01:49,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-31 17:01:49,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-31 17:01:49,764 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-31 17:01:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:54,542 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-31 17:01:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 17:01:54,542 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-31 17:01:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:54,543 INFO L225 Difference]: With dead ends: 350 [2019-01-31 17:01:54,543 INFO L226 Difference]: Without dead ends: 349 [2019-01-31 17:01:54,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-31 17:01:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-31 17:01:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-31 17:01:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-31 17:01:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-31 17:01:54,630 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-31 17:01:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:54,630 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-31 17:01:54,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-31 17:01:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-31 17:01:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-31 17:01:54,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:54,631 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-31 17:01:54,632 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-31 17:01:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:54,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:54,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:57,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:57,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:57,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:57,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:57,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:57,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:57,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:57,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:57,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-31 17:01:57,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:57,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:57,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:57,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:57,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:57,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:00,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:05,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:05,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-31 17:02:05,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:05,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-31 17:02:05,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-31 17:02:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:02:05,313 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-31 17:02:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:10,150 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-31 17:02:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 17:02:10,150 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-31 17:02:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:10,151 INFO L225 Difference]: With dead ends: 355 [2019-01-31 17:02:10,152 INFO L226 Difference]: Without dead ends: 354 [2019-01-31 17:02:10,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-31 17:02:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-31 17:02:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-31 17:02:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-31 17:02:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-31 17:02:10,240 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-31 17:02:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:10,241 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-31 17:02:10,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-31 17:02:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-31 17:02:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-31 17:02:10,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:10,242 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-31 17:02:10,242 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-31 17:02:10,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:10,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:10,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:12,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:12,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:12,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:12,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:12,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:12,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:02:12,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:02:12,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:02:12,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:12,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:12,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:12,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:13,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:13,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:16,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:20,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:20,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-31 17:02:20,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:20,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-31 17:02:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-31 17:02:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-31 17:02:20,837 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-31 17:02:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:25,824 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-31 17:02:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 17:02:25,824 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-31 17:02:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:25,826 INFO L225 Difference]: With dead ends: 360 [2019-01-31 17:02:25,826 INFO L226 Difference]: Without dead ends: 359 [2019-01-31 17:02:25,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-31 17:02:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-31 17:02:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-31 17:02:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-31 17:02:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-31 17:02:25,914 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-31 17:02:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:25,915 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-31 17:02:25,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-31 17:02:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-31 17:02:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-31 17:02:25,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:25,916 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-31 17:02:25,916 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-31 17:02:25,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:25,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:25,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:28,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:28,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:28,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:28,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:28,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:28,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:28,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:28,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:28,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:28,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:28,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:28,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:28,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:32,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:36,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:36,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-31 17:02:36,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:36,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-31 17:02:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-31 17:02:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:02:36,579 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-31 17:02:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:41,729 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-31 17:02:41,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 17:02:41,730 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-31 17:02:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:41,731 INFO L225 Difference]: With dead ends: 365 [2019-01-31 17:02:41,731 INFO L226 Difference]: Without dead ends: 364 [2019-01-31 17:02:41,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-31 17:02:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-31 17:02:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-31 17:02:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-31 17:02:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-31 17:02:41,826 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-31 17:02:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:41,826 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-31 17:02:41,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-31 17:02:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-31 17:02:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-31 17:02:41,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:41,828 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-31 17:02:41,828 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-31 17:02:41,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:41,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:41,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:41,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:41,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:44,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:44,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:44,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:44,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:44,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:44,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:44,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:44,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:45,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-31 17:02:45,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:45,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:45,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:45,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:45,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:45,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:48,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:52,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-31 17:02:52,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:52,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-31 17:02:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-31 17:02:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-31 17:02:52,933 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-31 17:02:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:58,142 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-31 17:02:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 17:02:58,142 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-31 17:02:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:58,144 INFO L225 Difference]: With dead ends: 370 [2019-01-31 17:02:58,144 INFO L226 Difference]: Without dead ends: 369 [2019-01-31 17:02:58,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-31 17:02:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-31 17:02:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-31 17:02:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-31 17:02:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-31 17:02:58,241 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-31 17:02:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:58,241 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-31 17:02:58,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-31 17:02:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-31 17:02:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-31 17:02:58,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:58,242 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-31 17:02:58,243 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-31 17:02:58,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:58,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:58,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:01,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:01,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:01,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:01,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:01,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:01,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:01,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:03:01,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:03:01,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:03:01,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:01,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:01,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:01,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:01,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:01,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:04,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:09,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:09,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-31 17:03:09,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:09,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-31 17:03:09,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-31 17:03:09,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:03:09,256 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-31 17:03:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:14,411 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-31 17:03:14,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 17:03:14,411 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-31 17:03:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:14,413 INFO L225 Difference]: With dead ends: 375 [2019-01-31 17:03:14,413 INFO L226 Difference]: Without dead ends: 374 [2019-01-31 17:03:14,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-31 17:03:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-31 17:03:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-31 17:03:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-31 17:03:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-31 17:03:14,512 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-31 17:03:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-31 17:03:14,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-31 17:03:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-31 17:03:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-31 17:03:14,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:14,514 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-31 17:03:14,514 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-31 17:03:14,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:14,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:14,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:17,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:17,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:17,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:17,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:17,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:17,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:17,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:03:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:17,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:17,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:17,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:17,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:17,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:21,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:26,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:26,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-31 17:03:26,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:26,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-31 17:03:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-31 17:03:26,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-31 17:03:26,050 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-31 17:03:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:31,530 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-31 17:03:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-31 17:03:31,531 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-31 17:03:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:31,532 INFO L225 Difference]: With dead ends: 380 [2019-01-31 17:03:31,532 INFO L226 Difference]: Without dead ends: 379 [2019-01-31 17:03:31,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-31 17:03:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-31 17:03:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-31 17:03:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-31 17:03:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-31 17:03:31,635 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-31 17:03:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:31,635 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-31 17:03:31,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-31 17:03:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-31 17:03:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-31 17:03:31,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:31,637 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-31 17:03:31,637 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-31 17:03:31,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:31,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:31,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:31,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:34,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:34,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:34,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:34,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:34,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:34,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:34,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:03:34,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:03:35,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-31 17:03:35,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:35,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:35,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:35,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:35,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:35,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:38,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:43,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:43,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-31 17:03:43,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:43,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-31 17:03:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-31 17:03:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:03:43,270 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-31 17:03:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:48,649 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-31 17:03:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 17:03:48,650 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-31 17:03:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:48,651 INFO L225 Difference]: With dead ends: 385 [2019-01-31 17:03:48,651 INFO L226 Difference]: Without dead ends: 384 [2019-01-31 17:03:48,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-31 17:03:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-31 17:03:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-31 17:03:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-31 17:03:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-31 17:03:48,757 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-31 17:03:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:48,757 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-31 17:03:48,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-31 17:03:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-31 17:03:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-31 17:03:48,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:48,759 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-31 17:03:48,759 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-31 17:03:48,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:48,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:48,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:51,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:51,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:51,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:51,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:51,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:51,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:51,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:03:51,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:03:52,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:03:52,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:52,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:52,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:52,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:52,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:52,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:55,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:00,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:00,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-31 17:04:00,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:00,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-31 17:04:00,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-31 17:04:00,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-31 17:04:00,183 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-31 17:04:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:05,843 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-31 17:04:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 17:04:05,844 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-31 17:04:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:05,845 INFO L225 Difference]: With dead ends: 390 [2019-01-31 17:04:05,845 INFO L226 Difference]: Without dead ends: 389 [2019-01-31 17:04:05,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-01-31 17:04:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-31 17:04:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-31 17:04:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-31 17:04:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-31 17:04:05,955 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-31 17:04:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:05,955 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-31 17:04:05,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-31 17:04:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-31 17:04:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-31 17:04:05,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:05,956 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-31 17:04:05,957 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:04:05,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-31 17:04:05,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:05,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:05,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:05,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:09,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:09,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:09,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:09,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:09,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:09,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:09,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:09,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:04:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:09,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:09,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:09,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:09,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:09,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:04:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:13,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-31 17:04:18,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:18,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-31 17:04:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-31 17:04:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:04:18,393 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-31 17:04:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:24,383 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-31 17:04:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 17:04:24,383 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-31 17:04:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:24,384 INFO L225 Difference]: With dead ends: 395 [2019-01-31 17:04:24,384 INFO L226 Difference]: Without dead ends: 394 [2019-01-31 17:04:24,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-31 17:04:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-31 17:04:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-31 17:04:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-31 17:04:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-31 17:04:24,496 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-31 17:04:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:24,496 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-31 17:04:24,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-31 17:04:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-31 17:04:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-31 17:04:24,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:24,497 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-31 17:04:24,498 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:04:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-31 17:04:24,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:24,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:24,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:27,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:27,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:27,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:27,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:27,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:27,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:27,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:04:27,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:04:28,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-31 17:04:28,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:28,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:28,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:28,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:28,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:28,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:04:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:32,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-31 17:04:36,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:36,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-31 17:04:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-31 17:04:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-31 17:04:36,880 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-31 17:04:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:43,063 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-31 17:04:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-31 17:04:43,063 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-31 17:04:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:43,065 INFO L225 Difference]: With dead ends: 400 [2019-01-31 17:04:43,065 INFO L226 Difference]: Without dead ends: 399 [2019-01-31 17:04:43,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-01-31 17:04:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-31 17:04:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-31 17:04:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-31 17:04:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-31 17:04:43,179 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-31 17:04:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:43,179 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-31 17:04:43,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-31 17:04:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-31 17:04:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-31 17:04:43,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:43,180 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-31 17:04:43,181 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:04:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-31 17:04:43,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:43,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:43,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:43,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:46,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:46,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:46,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:46,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:46,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:46,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:46,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:46,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:46,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:46,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:46,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:46,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:46,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:46,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:04:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:50,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:55,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:55,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-31 17:04:55,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:55,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-31 17:04:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-31 17:04:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:04:55,210 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-31 17:05:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:01,205 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-31 17:05:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 17:05:01,206 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-31 17:05:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:01,207 INFO L225 Difference]: With dead ends: 405 [2019-01-31 17:05:01,207 INFO L226 Difference]: Without dead ends: 404 [2019-01-31 17:05:01,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-31 17:05:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-31 17:05:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-31 17:05:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-31 17:05:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-31 17:05:01,325 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-31 17:05:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:01,326 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-31 17:05:01,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-31 17:05:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-31 17:05:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-31 17:05:01,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:01,327 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-31 17:05:01,327 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-31 17:05:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:01,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:01,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:04,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:04,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:04,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:04,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:04,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:04,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:04,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:05,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:05,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:05:05,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:05,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:05,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:09,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:13,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:13,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-31 17:05:13,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:13,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-31 17:05:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-31 17:05:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-31 17:05:13,961 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-31 17:05:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:20,240 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-31 17:05:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-31 17:05:20,241 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-31 17:05:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:20,242 INFO L225 Difference]: With dead ends: 410 [2019-01-31 17:05:20,242 INFO L226 Difference]: Without dead ends: 409 [2019-01-31 17:05:20,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-31 17:05:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-31 17:05:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-31 17:05:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-31 17:05:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-31 17:05:20,364 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-31 17:05:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:20,364 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-31 17:05:20,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-31 17:05:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-31 17:05:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-31 17:05:20,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:20,366 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-31 17:05:20,366 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-31 17:05:20,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:20,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:23,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:23,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:23,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:23,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:23,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:23,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:23,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:05:23,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:05:24,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-31 17:05:24,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:24,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:24,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:05:24,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:24,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:24,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:28,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:33,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:33,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-31 17:05:33,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:33,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-31 17:05:33,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-31 17:05:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:05:33,274 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-31 17:05:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:39,913 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-31 17:05:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 17:05:39,914 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-31 17:05:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:39,915 INFO L225 Difference]: With dead ends: 415 [2019-01-31 17:05:39,915 INFO L226 Difference]: Without dead ends: 414 [2019-01-31 17:05:39,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-31 17:05:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-31 17:05:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-31 17:05:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-31 17:05:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-31 17:05:40,041 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-31 17:05:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:40,042 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-31 17:05:40,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-31 17:05:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-31 17:05:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-31 17:05:40,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:40,043 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-31 17:05:40,044 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:40,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-31 17:05:40,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:40,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:40,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:43,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:43,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:43,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:43,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:43,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:43,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:43,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:05:43,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:05:43,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:05:43,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:43,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:43,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:05:43,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:43,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:43,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:47,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:52,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:52,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-31 17:05:52,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:52,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-31 17:05:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-31 17:05:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-31 17:05:52,344 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-31 17:05:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:58,986 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-31 17:05:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 17:05:58,987 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-31 17:05:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:58,988 INFO L225 Difference]: With dead ends: 420 [2019-01-31 17:05:58,988 INFO L226 Difference]: Without dead ends: 419 [2019-01-31 17:05:58,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-01-31 17:05:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-31 17:05:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-31 17:05:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-31 17:05:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-31 17:05:59,115 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-31 17:05:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:59,116 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-31 17:05:59,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-31 17:05:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-31 17:05:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-31 17:05:59,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:59,118 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-31 17:05:59,118 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-31 17:05:59,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:59,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:59,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:02,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:02,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:02,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:02,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:02,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:02,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:02,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:02,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:02,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:02,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:06:02,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:02,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:06:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:07,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:11,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:11,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-31 17:06:11,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:11,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-31 17:06:11,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-31 17:06:11,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:06:11,843 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-31 17:06:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:18,540 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-31 17:06:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:06:18,540 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-31 17:06:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:18,542 INFO L225 Difference]: With dead ends: 425 [2019-01-31 17:06:18,542 INFO L226 Difference]: Without dead ends: 424 [2019-01-31 17:06:18,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-01-31 17:06:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-31 17:06:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-31 17:06:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-31 17:06:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-31 17:06:18,674 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-31 17:06:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:18,674 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-31 17:06:18,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-31 17:06:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-31 17:06:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-31 17:06:18,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:18,676 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-31 17:06:18,676 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:06:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-31 17:06:18,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:18,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:22,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:22,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:22,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:22,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:22,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:22,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:22,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:22,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:23,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-31 17:06:23,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:23,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:23,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:06:23,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:23,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:23,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:06:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:27,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:32,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-31 17:06:32,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:32,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-31 17:06:32,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-31 17:06:32,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-01-31 17:06:32,185 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-01-31 17:06:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:38,974 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-01-31 17:06:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-31 17:06:38,974 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-01-31 17:06:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:38,976 INFO L225 Difference]: With dead ends: 430 [2019-01-31 17:06:38,976 INFO L226 Difference]: Without dead ends: 429 [2019-01-31 17:06:38,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-01-31 17:06:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-01-31 17:06:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-01-31 17:06:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-31 17:06:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-01-31 17:06:39,109 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-01-31 17:06:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:39,109 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-01-31 17:06:39,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-31 17:06:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-01-31 17:06:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-01-31 17:06:39,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:39,112 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-01-31 17:06:39,112 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:06:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:39,112 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-01-31 17:06:39,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:39,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:39,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:39,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:39,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:43,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:43,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:43,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:43,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:43,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:43,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:43,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:43,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:43,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:43,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:43,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:06:43,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:06:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:48,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:52,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-31 17:06:52,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:52,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-31 17:06:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-31 17:06:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:06:52,657 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-01-31 17:06:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:59,471 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-01-31 17:06:59,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:06:59,472 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-01-31 17:06:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:59,473 INFO L225 Difference]: With dead ends: 435 [2019-01-31 17:06:59,473 INFO L226 Difference]: Without dead ends: 434 [2019-01-31 17:06:59,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-01-31 17:06:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-31 17:06:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-01-31 17:06:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-01-31 17:06:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-01-31 17:06:59,616 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-01-31 17:06:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:59,617 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-01-31 17:06:59,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-31 17:06:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-01-31 17:06:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-01-31 17:06:59,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:59,618 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-01-31 17:06:59,619 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:06:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-01-31 17:06:59,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:59,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:03,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:03,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,329 INFO 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 [2019-01-31 17:07:03,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:03,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:07:03,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:07:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-31 17:07:12,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-31 17:07:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-31 17:07:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13931, Invalid=22359, Unknown=0, NotChecked=0, Total=36290 [2019-01-31 17:07:12,943 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2019-01-31 17:07:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:19,718 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2019-01-31 17:07:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-31 17:07:19,719 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2019-01-31 17:07:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:19,720 INFO L225 Difference]: With dead ends: 440 [2019-01-31 17:07:19,720 INFO L226 Difference]: Without dead ends: 439 [2019-01-31 17:07:19,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 684 SyntacticMatches, 72 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35812 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=26891, Invalid=50115, Unknown=0, NotChecked=0, Total=77006 [2019-01-31 17:07:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-31 17:07:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-01-31 17:07:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-01-31 17:07:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2019-01-31 17:07:19,865 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2019-01-31 17:07:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:19,865 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2019-01-31 17:07:19,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-31 17:07:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2019-01-31 17:07:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-01-31 17:07:19,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:19,867 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2019-01-31 17:07:19,867 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:07:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2019-01-31 17:07:19,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:19,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:19,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat