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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:26:49,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:26:49,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:26:49,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:26:49,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:26:49,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:26:49,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:26:49,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:26:49,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:26:49,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:26:49,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:26:49,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:26:49,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:26:49,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:26:49,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:26:49,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:26:49,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:26:49,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:26:49,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:26:49,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:26:49,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:26:49,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:26:49,684 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:26:49,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:26:49,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:26:49,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:26:49,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:26:49,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:26:49,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:26:49,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:26:49,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:26:49,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:26:49,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:26:49,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:26:49,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:26:49,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:26:49,692 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-18 17:26:49,705 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:26:49,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:26:49,706 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:26:49,706 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:26:49,706 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:26:49,706 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:26:49,706 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:26:49,707 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:26:49,707 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:26:49,707 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:26:49,707 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:26:49,708 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:26:49,708 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:26:49,708 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:26:49,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:26:49,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:26:49,709 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:26:49,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:26:49,709 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:26:49,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:26:49,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:26:49,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:26:49,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:26:49,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:26:49,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:26:49,711 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:26:49,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:26:49,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:26:49,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:26:49,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:26:49,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:26:49,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:49,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:26:49,713 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:26:49,713 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:26:49,713 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:26:49,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:26:49,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:26:49,714 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:26:49,714 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:26:49,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:26:49,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:26:49,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:26:49,772 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:26:49,772 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:26:49,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-01-18 17:26:49,773 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-01-18 17:26:49,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:26:49,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:26:49,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:49,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:26:49,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:26:49,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:49,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:26:49,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:26:49,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:26:49,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... [2019-01-18 17:26:49,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:26:49,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:26:49,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:26:49,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:26:49,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:26:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:26:50,365 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:26:50,365 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-18 17:26:50,367 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:50 BoogieIcfgContainer [2019-01-18 17:26:50,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:26:50,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:26:50,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:26:50,371 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:26:50,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:49" (1/2) ... [2019-01-18 17:26:50,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eba4a00 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:26:50, skipping insertion in model container [2019-01-18 17:26:50,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:50" (2/2) ... [2019-01-18 17:26:50,375 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-01-18 17:26:50,384 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:26:50,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-18 17:26:50,411 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-18 17:26:50,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:26:50,444 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:26:50,444 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:26:50,444 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:26:50,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:26:50,445 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:26:50,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:26:50,445 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:26:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-18 17:26:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:26:50,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:50,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:26:50,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2019-01-18 17:26:50,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:50,711 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-18 17:26:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:26:50,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:50,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:26:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:26:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:26:50,735 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-01-18 17:26:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:50,843 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-18 17:26:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:26:50,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:26:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:50,858 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:26:50,858 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:26:50,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:26:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:26:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-18 17:26:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:26:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-18 17:26:50,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-18 17:26:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:50,898 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-18 17:26:50,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:26:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-18 17:26:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:26:50,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:50,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:26:50,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2019-01-18 17:26:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:50,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:51,048 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-18 17:26:51,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:51,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:26:51,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:51,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:26:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:26:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:26:51,052 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-01-18 17:26:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:51,254 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-18 17:26:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:26:51,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-18 17:26:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:51,256 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:26:51,256 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:26:51,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 17:26:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:26:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-18 17:26:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:26:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-18 17:26:51,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-01-18 17:26:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:51,263 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-18 17:26:51,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:26:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-18 17:26:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:26:51,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:51,264 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:26:51,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2019-01-18 17:26:51,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:51,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:51,297 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-18 17:26:51,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:51,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:26:51,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:51,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:26:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:26:51,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:26:51,300 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-18 17:26:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:51,319 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-18 17:26:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:26:51,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-18 17:26:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:51,321 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:26:51,321 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:26:51,322 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-18 17:26:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:26:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 17:26:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:26:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 17:26:51,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-18 17:26:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:51,326 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 17:26:51,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:26:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 17:26:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:26:51,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:51,327 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-18 17:26:51,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2019-01-18 17:26:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:51,556 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-18 17:26:51,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:51,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:51,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-01-18 17:26:51,560 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2019-01-18 17:26:51,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:26:51,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:26:51,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:26:51,783 INFO L272 AbstractInterpreter]: Visited 8 different actions 26 times. Merged at 6 different actions 18 times. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 3. Performed 252 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-18 17:26:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:51,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:26:51,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:51,791 INFO 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-18 17:26:51,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:51,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:51,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:52,008 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-18 17:26:52,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:52,048 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-18 17:26:52,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:52,188 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-18 17:26:52,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:52,295 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-18 17:26:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-18 17:26:52,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:52,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:26:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:26:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:26:52,320 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-18 17:26:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:52,582 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-18 17:26:52,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:26:52,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-18 17:26:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:52,585 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:26:52,585 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:26:52,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:26:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:26:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-18 17:26:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:26:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-18 17:26:52,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2019-01-18 17:26:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:52,591 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-18 17:26:52,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:26:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-18 17:26:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:26:52,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:52,594 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-18 17:26:52,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2019-01-18 17:26:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:52,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:52,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:52,812 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-18 17:26:52,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:52,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:52,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:52,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,813 INFO 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-18 17:26:52,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:52,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:52,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:26:52,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:52,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:52,878 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-18 17:26:52,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:52,960 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-18 17:26:52,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:53,393 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-18 17:26:53,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:53,516 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-18 17:26:53,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:53,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-01-18 17:26:53,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:53,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:26:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:26:53,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:26:53,538 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-18 17:26:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:53,721 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-18 17:26:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:26:53,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-18 17:26:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:53,723 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:26:53,724 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:26:53,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:26:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:26:53,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-01-18 17:26:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:26:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-18 17:26:53,729 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2019-01-18 17:26:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:53,729 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-18 17:26:53,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:26:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-18 17:26:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-18 17:26:53,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:53,730 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2019-01-18 17:26:53,731 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2019-01-18 17:26:53,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:53,904 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-18 17:26:53,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:53,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:53,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:53,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,906 INFO 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-18 17:26:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:53,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:53,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:53,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:53,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:53,955 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-18 17:26:53,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,964 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-18 17:26:53,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:54,095 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-18 17:26:54,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:54,324 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-18 17:26:54,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:54,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2019-01-18 17:26:54,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:54,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:26:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:26:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:26:54,349 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-01-18 17:26:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:54,602 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-18 17:26:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:26:54,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-18 17:26:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:54,604 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:26:54,604 INFO L226 Difference]: Without dead ends: 30 [2019-01-18 17:26:54,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:26:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-18 17:26:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-18 17:26:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:26:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-18 17:26:54,611 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2019-01-18 17:26:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:54,611 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-18 17:26:54,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:26:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-18 17:26:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:26:54,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:54,612 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2019-01-18 17:26:54,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:54,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2019-01-18 17:26:54,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:54,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:54,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:54,746 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-18 17:26:54,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:54,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:54,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:54,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,747 INFO 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-18 17:26:54,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:54,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:54,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:54,808 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-18 17:26:54,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:54,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-18 17:26:54,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:54,943 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-18 17:26:54,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:55,056 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-18 17:26:55,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:55,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-01-18 17:26:55,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:55,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:26:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:26:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:26:55,088 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-01-18 17:26:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:55,305 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-18 17:26:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:26:55,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-18 17:26:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:55,308 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:26:55,309 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:26:55,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=371, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:26:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:26:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-18 17:26:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:26:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-18 17:26:55,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-01-18 17:26:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:55,316 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-18 17:26:55,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:26:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-18 17:26:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:26:55,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:55,317 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2019-01-18 17:26:55,318 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2019-01-18 17:26:55,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:55,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:55,489 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-18 17:26:55,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:55,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:55,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:55,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:55,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:55,491 INFO 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-18 17:26:55,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:55,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:55,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-18 17:26:55,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:55,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:55,542 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-18 17:26:55,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:55,552 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-18 17:26:55,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:55,711 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-18 17:26:55,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:55,833 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-18 17:26:55,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:55,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2019-01-18 17:26:55,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:55,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:26:55,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:26:55,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:26:55,854 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2019-01-18 17:26:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:56,431 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-18 17:26:56,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:26:56,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-01-18 17:26:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:56,433 INFO L225 Difference]: With dead ends: 41 [2019-01-18 17:26:56,434 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:26:56,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=500, Unknown=0, NotChecked=0, Total=812 [2019-01-18 17:26:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:26:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-18 17:26:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:26:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-18 17:26:56,441 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2019-01-18 17:26:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:56,442 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-18 17:26:56,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:26:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-18 17:26:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:26:56,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:56,443 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2019-01-18 17:26:56,443 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2019-01-18 17:26:56,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:56,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:56,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:56,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:56,911 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-18 17:26:56,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:56,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:56,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:56,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:56,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:56,911 INFO 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-18 17:26:56,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:56,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:56,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:56,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:56,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:56,990 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-18 17:26:56,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:57,012 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-18 17:26:57,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:57,242 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-18 17:26:57,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:57,611 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-18 17:26:57,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:57,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2019-01-18 17:26:57,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:57,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:26:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:26:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:26:57,633 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-01-18 17:26:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:58,008 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-18 17:26:58,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:26:58,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-01-18 17:26:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:58,011 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:26:58,011 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:26:58,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-01-18 17:26:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:26:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-18 17:26:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:26:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-18 17:26:58,019 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-01-18 17:26:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:58,019 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-18 17:26:58,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:26:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-18 17:26:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-18 17:26:58,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:58,021 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2019-01-18 17:26:58,021 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2019-01-18 17:26:58,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:58,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:58,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:58,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:58,177 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-18 17:26:58,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:58,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:58,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:58,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:58,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:58,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 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-18 17:26:58,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:58,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:58,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:58,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-18 17:26:58,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:58,277 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-18 17:26:58,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:58,536 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-18 17:26:58,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:58,670 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-18 17:26:58,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:58,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2019-01-18 17:26:58,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:58,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:26:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:26:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2019-01-18 17:26:58,698 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2019-01-18 17:26:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:59,069 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-18 17:26:59,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:26:59,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-01-18 17:26:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:59,071 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:26:59,072 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 17:26:59,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=517, Invalid=815, Unknown=0, NotChecked=0, Total=1332 [2019-01-18 17:26:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 17:26:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-18 17:26:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:26:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-18 17:26:59,080 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2019-01-18 17:26:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:59,081 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-18 17:26:59,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:26:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-18 17:26:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:26:59,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:59,082 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2019-01-18 17:26:59,082 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:26:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2019-01-18 17:26:59,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:59,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:59,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:59,300 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-18 17:26:59,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:59,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:59,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:59,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:59,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:59,301 INFO 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-18 17:26:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:59,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:59,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-18 17:26:59,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:59,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:59,363 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-18 17:26:59,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,376 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-18 17:26:59,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:26:59,526 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-18 17:26:59,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:59,802 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-18 17:26:59,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2019-01-18 17:26:59,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:59,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:26:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:26:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=605, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:26:59,823 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-01-18 17:27:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:00,195 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-18 17:27:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:27:00,196 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-01-18 17:27:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:00,197 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:27:00,197 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:27:00,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=639, Invalid=1001, Unknown=0, NotChecked=0, Total=1640 [2019-01-18 17:27:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:27:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-18 17:27:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:27:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-18 17:27:00,205 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2019-01-18 17:27:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:00,206 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-18 17:27:00,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:27:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-18 17:27:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:27:00,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:00,207 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2019-01-18 17:27:00,207 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:00,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2019-01-18 17:27:00,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:00,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:00,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:00,584 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-18 17:27:00,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:00,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:00,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:00,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:00,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:00,585 INFO 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-18 17:27:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:00,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:00,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:00,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:00,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:00,665 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-18 17:27:00,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:00,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-18 17:27:00,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:00,835 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-18 17:27:00,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:01,018 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-18 17:27:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:01,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-01-18 17:27:01,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:01,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:27:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:27:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=721, Unknown=0, NotChecked=0, Total=1190 [2019-01-18 17:27:01,041 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2019-01-18 17:27:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:01,473 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-18 17:27:01,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:27:01,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-01-18 17:27:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:01,474 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:27:01,474 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 17:27:01,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=774, Invalid=1206, Unknown=0, NotChecked=0, Total=1980 [2019-01-18 17:27:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 17:27:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-18 17:27:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:27:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-18 17:27:01,489 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2019-01-18 17:27:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:01,490 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-18 17:27:01,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:27:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-18 17:27:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:27:01,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:01,491 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2019-01-18 17:27:01,491 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2019-01-18 17:27:01,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:03,005 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-18 17:27:03,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:03,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:03,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:03,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:03,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:03,006 INFO 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-18 17:27:03,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:03,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:03,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:03,065 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-18 17:27:03,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:03,076 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-18 17:27:03,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:03,303 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-18 17:27:03,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:03,638 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-18 17:27:03,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:03,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2019-01-18 17:27:03,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:03,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:27:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:27:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=847, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:27:03,659 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-01-18 17:27:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:04,104 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-18 17:27:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:27:04,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-18 17:27:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:04,105 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:27:04,105 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:27:04,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2019-01-18 17:27:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:27:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-01-18 17:27:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 17:27:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-18 17:27:04,121 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2019-01-18 17:27:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:04,121 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-18 17:27:04,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:27:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-18 17:27:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-18 17:27:04,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:04,122 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2019-01-18 17:27:04,122 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2019-01-18 17:27:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:04,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:04,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:04,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:04,395 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-18 17:27:04,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:04,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:04,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:04,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:04,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:04,396 INFO 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-18 17:27:04,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:04,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:04,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-18 17:27:04,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:04,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:04,496 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-18 17:27:04,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:04,506 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-18 17:27:04,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:04,731 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-18 17:27:04,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:05,009 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-18 17:27:05,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-01-18 17:27:05,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:05,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:27:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:27:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=983, Unknown=0, NotChecked=0, Total=1640 [2019-01-18 17:27:05,030 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2019-01-18 17:27:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:05,446 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-18 17:27:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:27:05,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-18 17:27:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:05,448 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:27:05,448 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:27:05,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1083, Invalid=1673, Unknown=0, NotChecked=0, Total=2756 [2019-01-18 17:27:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:27:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-01-18 17:27:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:27:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-18 17:27:05,461 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2019-01-18 17:27:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:05,461 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-18 17:27:05,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:27:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-18 17:27:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:27:05,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:05,462 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2019-01-18 17:27:05,463 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2019-01-18 17:27:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:05,729 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-18 17:27:05,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:05,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:05,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:05,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:05,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:05,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:27:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:05,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:05,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:05,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:05,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:05,811 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-18 17:27:05,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:05,831 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-18 17:27:05,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:06,274 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-18 17:27:06,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:07,139 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-18 17:27:07,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:07,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2019-01-18 17:27:07,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:07,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:27:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:27:07,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1129, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:27:07,160 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2019-01-18 17:27:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:07,737 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-18 17:27:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:27:07,737 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-01-18 17:27:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:07,738 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:27:07,738 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:27:07,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1257, Invalid=1935, Unknown=0, NotChecked=0, Total=3192 [2019-01-18 17:27:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:27:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-01-18 17:27:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:27:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-18 17:27:07,755 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2019-01-18 17:27:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:07,756 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-18 17:27:07,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:27:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-18 17:27:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:27:07,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:07,757 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2019-01-18 17:27:07,757 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2019-01-18 17:27:07,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:07,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:07,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:08,133 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-18 17:27:08,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:08,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:08,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:08,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:08,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:08,134 INFO 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-18 17:27:08,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:08,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:08,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:08,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-18 17:27:08,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:08,230 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-18 17:27:08,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:08,498 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-18 17:27:08,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:08,985 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-18 17:27:09,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2019-01-18 17:27:09,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:09,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:27:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:27:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-01-18 17:27:09,006 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2019-01-18 17:27:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:09,643 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-18 17:27:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:27:09,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-01-18 17:27:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:09,644 INFO L225 Difference]: With dead ends: 81 [2019-01-18 17:27:09,645 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:27:09,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1444, Invalid=2216, Unknown=0, NotChecked=0, Total=3660 [2019-01-18 17:27:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:27:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-18 17:27:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:27:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-18 17:27:09,656 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2019-01-18 17:27:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:09,657 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-18 17:27:09,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:27:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-18 17:27:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:27:09,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:09,658 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2019-01-18 17:27:09,658 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2019-01-18 17:27:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:09,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:09,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:09,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:09,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:10,570 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-18 17:27:10,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:10,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:10,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:10,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:10,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:10,571 INFO 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-18 17:27:10,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:10,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:10,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-18 17:27:10,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:10,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:10,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-18 17:27:10,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:10,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-18 17:27:10,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:11,268 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-18 17:27:11,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:11,755 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-18 17:27:11,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:11,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2019-01-18 17:27:11,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:11,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:27:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:27:11,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=1451, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:27:11,775 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2019-01-18 17:27:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:12,233 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-18 17:27:12,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:27:12,233 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-01-18 17:27:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:12,234 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:27:12,234 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:27:12,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1644, Invalid=2516, Unknown=0, NotChecked=0, Total=4160 [2019-01-18 17:27:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:27:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-18 17:27:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:27:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-18 17:27:12,247 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2019-01-18 17:27:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:12,247 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-18 17:27:12,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:27:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-18 17:27:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-18 17:27:12,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:12,248 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2019-01-18 17:27:12,249 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2019-01-18 17:27:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:12,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:12,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:12,545 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-18 17:27:12,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:12,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:12,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:12,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:12,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:12,546 INFO 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-18 17:27:12,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:12,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:12,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:12,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:12,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:12,627 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-18 17:27:12,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:12,634 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-18 17:27:12,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:12,949 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-18 17:27:12,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:13,411 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-18 17:27:13,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2019-01-18 17:27:13,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:13,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:27:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:27:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1627, Unknown=0, NotChecked=0, Total=2756 [2019-01-18 17:27:13,432 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2019-01-18 17:27:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:13,971 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-18 17:27:13,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:27:13,972 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-01-18 17:27:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:13,973 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:27:13,973 INFO L226 Difference]: Without dead ends: 90 [2019-01-18 17:27:13,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1857, Invalid=2835, Unknown=0, NotChecked=0, Total=4692 [2019-01-18 17:27:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-18 17:27:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-01-18 17:27:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:27:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-18 17:27:13,988 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2019-01-18 17:27:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:13,988 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-18 17:27:13,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:27:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-18 17:27:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:27:13,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:13,989 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2019-01-18 17:27:13,990 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2019-01-18 17:27:13,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:13,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:13,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:14,539 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-18 17:27:14,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:14,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:14,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:14,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:14,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:14,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 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-18 17:27:14,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:14,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:14,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:14,606 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-18 17:27:14,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:14,617 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-18 17:27:14,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:15,000 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-18 17:27:15,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:15,457 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-18 17:27:15,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:15,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2019-01-18 17:27:15,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:15,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:27:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:27:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=1813, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:27:15,478 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2019-01-18 17:27:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:16,058 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-18 17:27:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:27:16,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-01-18 17:27:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:16,059 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:27:16,060 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:27:16,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2083, Invalid=3173, Unknown=0, NotChecked=0, Total=5256 [2019-01-18 17:27:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:27:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-18 17:27:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:27:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-18 17:27:16,071 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2019-01-18 17:27:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:16,071 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-18 17:27:16,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:27:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-18 17:27:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:27:16,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:16,072 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2019-01-18 17:27:16,072 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2019-01-18 17:27:16,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:16,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:16,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:16,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:16,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:16,406 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-18 17:27:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:16,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:16,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:16,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:16,407 INFO 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-18 17:27:16,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:16,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:16,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-18 17:27:16,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:16,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:16,639 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-18 17:27:16,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:16,648 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-18 17:27:16,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:16,986 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-18 17:27:16,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:17,467 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-18 17:27:17,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:17,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2019-01-18 17:27:17,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:17,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:27:17,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:27:17,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=2009, Unknown=0, NotChecked=0, Total=3422 [2019-01-18 17:27:17,488 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2019-01-18 17:27:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:18,090 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-18 17:27:18,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:27:18,091 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-01-18 17:27:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:18,092 INFO L225 Difference]: With dead ends: 101 [2019-01-18 17:27:18,092 INFO L226 Difference]: Without dead ends: 100 [2019-01-18 17:27:18,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2322, Invalid=3530, Unknown=0, NotChecked=0, Total=5852 [2019-01-18 17:27:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-18 17:27:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-01-18 17:27:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 17:27:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-18 17:27:18,103 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2019-01-18 17:27:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:18,103 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-18 17:27:18,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:27:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-18 17:27:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 17:27:18,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:18,104 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2019-01-18 17:27:18,105 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2019-01-18 17:27:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:18,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:18,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:18,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:18,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:18,460 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-18 17:27:18,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:18,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:18,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:18,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,461 INFO 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-18 17:27:18,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:18,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:18,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:18,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:18,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:18,572 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-18 17:27:18,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:18,671 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-18 17:27:18,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:19,001 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-18 17:27:19,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:19,905 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-18 17:27:19,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:19,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2019-01-18 17:27:19,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:19,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:27:19,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:27:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=2215, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:19,928 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2019-01-18 17:27:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:20,628 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-18 17:27:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:27:20,629 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-01-18 17:27:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:20,630 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:27:20,630 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:27:20,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2574, Invalid=3906, Unknown=0, NotChecked=0, Total=6480 [2019-01-18 17:27:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:27:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-01-18 17:27:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 17:27:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-18 17:27:20,642 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2019-01-18 17:27:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:20,642 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-18 17:27:20,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:27:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-18 17:27:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-18 17:27:20,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:20,643 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2019-01-18 17:27:20,644 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:20,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2019-01-18 17:27:20,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:20,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:20,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:21,069 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-18 17:27:21,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:21,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:21,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:21,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:21,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:21,069 INFO 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-18 17:27:21,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:21,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:21,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:21,146 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-18 17:27:21,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:21,158 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-18 17:27:21,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:21,583 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-18 17:27:21,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:22,215 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-18 17:27:22,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:22,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2019-01-18 17:27:22,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:22,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:27:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:27:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=2431, Unknown=0, NotChecked=0, Total=4160 [2019-01-18 17:27:22,236 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2019-01-18 17:27:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:22,954 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-18 17:27:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:27:22,957 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2019-01-18 17:27:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:22,958 INFO L225 Difference]: With dead ends: 111 [2019-01-18 17:27:22,958 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 17:27:22,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2839, Invalid=4301, Unknown=0, NotChecked=0, Total=7140 [2019-01-18 17:27:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 17:27:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-01-18 17:27:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 17:27:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-18 17:27:22,970 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2019-01-18 17:27:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:22,971 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-18 17:27:22,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:27:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-18 17:27:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 17:27:22,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:22,972 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2019-01-18 17:27:22,972 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2019-01-18 17:27:22,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:22,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:22,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:22,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:22,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:23,394 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-18 17:27:23,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:23,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:23,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:23,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:23,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:23,395 INFO 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-18 17:27:23,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:23,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:23,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-18 17:27:23,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:23,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:23,524 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-18 17:27:23,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:23,536 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-18 17:27:23,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:23,931 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-18 17:27:23,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:25,002 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-18 17:27:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:25,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2019-01-18 17:27:25,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:27:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:27:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=2657, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:27:25,023 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2019-01-18 17:27:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:25,833 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-18 17:27:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:27:25,834 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2019-01-18 17:27:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:25,835 INFO L225 Difference]: With dead ends: 116 [2019-01-18 17:27:25,835 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:27:25,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3117, Invalid=4715, Unknown=0, NotChecked=0, Total=7832 [2019-01-18 17:27:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:27:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-01-18 17:27:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 17:27:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-18 17:27:25,850 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2019-01-18 17:27:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:25,850 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-18 17:27:25,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:27:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-18 17:27:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 17:27:25,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:25,851 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2019-01-18 17:27:25,852 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2019-01-18 17:27:25,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:25,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:25,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:26,883 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-18 17:27:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:26,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:26,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:26,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:26,885 INFO 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-18 17:27:26,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:26,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:26,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:26,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:26,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:26,993 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-18 17:27:26,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:27,073 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-18 17:27:27,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:27,583 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-18 17:27:27,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:28,296 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-18 17:27:28,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:28,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2019-01-18 17:27:28,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:28,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:27:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:27:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2893, Unknown=0, NotChecked=0, Total=4970 [2019-01-18 17:27:28,317 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2019-01-18 17:27:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:29,171 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-01-18 17:27:29,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:27:29,171 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-01-18 17:27:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:29,172 INFO L225 Difference]: With dead ends: 121 [2019-01-18 17:27:29,172 INFO L226 Difference]: Without dead ends: 120 [2019-01-18 17:27:29,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3408, Invalid=5148, Unknown=0, NotChecked=0, Total=8556 [2019-01-18 17:27:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-18 17:27:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-18 17:27:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-18 17:27:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-18 17:27:29,191 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2019-01-18 17:27:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:29,191 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-18 17:27:29,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:27:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-18 17:27:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-18 17:27:29,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:29,192 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2019-01-18 17:27:29,192 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2019-01-18 17:27:29,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,148 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-18 17:27:30,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:30,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:30,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:30,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:27:30,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:30,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:30,239 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-18 17:27:30,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:30,249 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-18 17:27:30,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:30,700 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-18 17:27:30,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:31,520 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-18 17:27:31,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:31,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2019-01-18 17:27:31,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:31,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:27:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:27:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3139, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:27:31,540 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2019-01-18 17:27:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:32,527 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-18 17:27:32,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:27:32,527 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2019-01-18 17:27:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:32,528 INFO L225 Difference]: With dead ends: 126 [2019-01-18 17:27:32,528 INFO L226 Difference]: Without dead ends: 125 [2019-01-18 17:27:32,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3712, Invalid=5600, Unknown=0, NotChecked=0, Total=9312 [2019-01-18 17:27:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-18 17:27:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-01-18 17:27:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-18 17:27:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-18 17:27:32,543 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2019-01-18 17:27:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:32,543 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-18 17:27:32,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:27:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-18 17:27:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-18 17:27:32,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:32,544 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2019-01-18 17:27:32,544 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2019-01-18 17:27:32,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:32,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:32,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:32,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:32,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:33,076 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-18 17:27:33,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:33,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:33,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:33,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:33,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:33,077 INFO 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-18 17:27:33,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:33,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:33,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-18 17:27:33,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:33,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:33,245 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-18 17:27:33,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:33,260 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-18 17:27:33,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:33,770 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-18 17:27:33,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:34,818 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-18 17:27:34,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:34,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2019-01-18 17:27:34,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:34,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:27:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:27:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2457, Invalid=3395, Unknown=0, NotChecked=0, Total=5852 [2019-01-18 17:27:34,838 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2019-01-18 17:27:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:35,779 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-18 17:27:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:27:35,779 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-01-18 17:27:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:35,780 INFO L225 Difference]: With dead ends: 131 [2019-01-18 17:27:35,780 INFO L226 Difference]: Without dead ends: 130 [2019-01-18 17:27:35,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4029, Invalid=6071, Unknown=0, NotChecked=0, Total=10100 [2019-01-18 17:27:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-18 17:27:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-18 17:27:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-18 17:27:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-01-18 17:27:35,795 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2019-01-18 17:27:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:35,796 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-01-18 17:27:35,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:27:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-01-18 17:27:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-18 17:27:35,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:35,796 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2019-01-18 17:27:35,797 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2019-01-18 17:27:35,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:35,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:36,394 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-18 17:27:36,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:36,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:36,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:36,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,394 INFO 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-18 17:27:36,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:36,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:36,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:36,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:36,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:36,505 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-18 17:27:36,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:36,516 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-18 17:27:36,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:37,007 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-18 17:27:37,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:38,021 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-18 17:27:38,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:38,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2019-01-18 17:27:38,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:38,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:27:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:27:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2659, Invalid=3661, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:27:38,041 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2019-01-18 17:27:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:39,060 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-18 17:27:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:27:39,061 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2019-01-18 17:27:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:39,062 INFO L225 Difference]: With dead ends: 136 [2019-01-18 17:27:39,062 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 17:27:39,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4359, Invalid=6561, Unknown=0, NotChecked=0, Total=10920 [2019-01-18 17:27:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 17:27:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-01-18 17:27:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 17:27:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-18 17:27:39,083 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2019-01-18 17:27:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:39,084 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-18 17:27:39,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:27:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-18 17:27:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-18 17:27:39,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:39,084 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2019-01-18 17:27:39,085 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2019-01-18 17:27:39,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:39,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:39,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:39,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:39,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:39,632 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-18 17:27:39,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:39,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:39,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:39,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:39,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:39,633 INFO 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-18 17:27:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:39,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:39,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:39,747 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-18 17:27:39,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:39,767 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-18 17:27:39,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:40,432 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-18 17:27:40,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:41,521 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-18 17:27:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:41,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2019-01-18 17:27:41,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:27:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:27:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3937, Unknown=0, NotChecked=0, Total=6806 [2019-01-18 17:27:41,542 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2019-01-18 17:27:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:42,558 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-01-18 17:27:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:27:42,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2019-01-18 17:27:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:42,560 INFO L225 Difference]: With dead ends: 141 [2019-01-18 17:27:42,560 INFO L226 Difference]: Without dead ends: 140 [2019-01-18 17:27:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4702, Invalid=7070, Unknown=0, NotChecked=0, Total=11772 [2019-01-18 17:27:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-18 17:27:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-01-18 17:27:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-18 17:27:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-18 17:27:42,577 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2019-01-18 17:27:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:42,577 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-18 17:27:42,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:27:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-18 17:27:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-18 17:27:42,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:42,578 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2019-01-18 17:27:42,578 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2019-01-18 17:27:42,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:42,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:43,311 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-18 17:27:43,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:43,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:43,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:43,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:43,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:43,311 INFO 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-18 17:27:43,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:43,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:43,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-18 17:27:43,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:43,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:43,502 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-18 17:27:43,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:43,593 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-18 17:27:43,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:45,218 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-18 17:27:45,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:46,259 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-18 17:27:46,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:46,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2019-01-18 17:27:46,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:46,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:27:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:27:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3087, Invalid=4223, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:46,279 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2019-01-18 17:27:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:47,414 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-01-18 17:27:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:27:47,414 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-01-18 17:27:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:47,415 INFO L225 Difference]: With dead ends: 146 [2019-01-18 17:27:47,415 INFO L226 Difference]: Without dead ends: 145 [2019-01-18 17:27:47,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5058, Invalid=7598, Unknown=0, NotChecked=0, Total=12656 [2019-01-18 17:27:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-18 17:27:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-01-18 17:27:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-18 17:27:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-01-18 17:27:47,434 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2019-01-18 17:27:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:47,435 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-01-18 17:27:47,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:27:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-01-18 17:27:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-18 17:27:47,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:47,435 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2019-01-18 17:27:47,435 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2019-01-18 17:27:47,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:47,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:47,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:47,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:47,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:48,206 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-18 17:27:48,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:48,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:48,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:48,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:48,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:48,207 INFO 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-18 17:27:48,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:48,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:48,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:48,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:48,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:48,328 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-18 17:27:48,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:48,338 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-18 17:27:48,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:49,024 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-18 17:27:49,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:50,375 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-18 17:27:50,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:50,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2019-01-18 17:27:50,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:50,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:27:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:27:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3313, Invalid=4519, Unknown=0, NotChecked=0, Total=7832 [2019-01-18 17:27:50,397 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2019-01-18 17:27:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:51,524 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-18 17:27:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:27:51,525 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2019-01-18 17:27:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:51,527 INFO L225 Difference]: With dead ends: 151 [2019-01-18 17:27:51,527 INFO L226 Difference]: Without dead ends: 150 [2019-01-18 17:27:51,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5427, Invalid=8145, Unknown=0, NotChecked=0, Total=13572 [2019-01-18 17:27:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-18 17:27:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-01-18 17:27:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-18 17:27:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-01-18 17:27:51,546 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2019-01-18 17:27:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-01-18 17:27:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:27:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-01-18 17:27:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-18 17:27:51,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:51,548 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2019-01-18 17:27:51,548 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2019-01-18 17:27:51,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:51,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:51,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:52,292 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-18 17:27:52,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:52,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:52,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:52,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:52,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:52,293 INFO 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-18 17:27:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:52,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:52,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:52,410 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-18 17:27:52,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:52,419 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-18 17:27:52,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:53,101 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-18 17:27:53,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:54,483 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-18 17:27:54,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:54,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2019-01-18 17:27:54,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:54,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:27:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:27:54,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3547, Invalid=4825, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:27:54,503 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2019-01-18 17:27:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:56,123 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-01-18 17:27:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:27:56,124 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2019-01-18 17:27:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:56,125 INFO L225 Difference]: With dead ends: 156 [2019-01-18 17:27:56,125 INFO L226 Difference]: Without dead ends: 155 [2019-01-18 17:27:56,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5809, Invalid=8711, Unknown=0, NotChecked=0, Total=14520 [2019-01-18 17:27:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-18 17:27:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-01-18 17:27:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-18 17:27:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-01-18 17:27:56,144 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2019-01-18 17:27:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:56,145 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-01-18 17:27:56,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:27:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-01-18 17:27:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-18 17:27:56,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:56,145 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2019-01-18 17:27:56,146 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:27:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2019-01-18 17:27:56,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:57,117 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-18 17:27:57,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:57,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:57,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:57,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:57,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:57,117 INFO 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-18 17:27:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:57,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:57,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-18 17:27:57,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:57,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:57,303 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-18 17:27:57,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:57,311 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-18 17:27:57,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:27:58,353 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-18 17:27:58,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:59,633 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-18 17:27:59,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2019-01-18 17:27:59,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:59,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:27:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:27:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3789, Invalid=5141, Unknown=0, NotChecked=0, Total=8930 [2019-01-18 17:27:59,654 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2019-01-18 17:28:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:00,992 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-01-18 17:28:00,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:28:00,993 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2019-01-18 17:28:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:00,994 INFO L225 Difference]: With dead ends: 161 [2019-01-18 17:28:00,994 INFO L226 Difference]: Without dead ends: 160 [2019-01-18 17:28:00,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4646 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6204, Invalid=9296, Unknown=0, NotChecked=0, Total=15500 [2019-01-18 17:28:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-18 17:28:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-01-18 17:28:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-18 17:28:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-18 17:28:01,022 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2019-01-18 17:28:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:01,022 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-18 17:28:01,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:28:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-18 17:28:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-18 17:28:01,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:01,023 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2019-01-18 17:28:01,023 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2019-01-18 17:28:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:01,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:01,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:01,839 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-18 17:28:01,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:01,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:01,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:01,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:01,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:01,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:28:01,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:01,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:01,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:01,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:01,968 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-18 17:28:01,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:01,978 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-18 17:28:01,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:02,727 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-18 17:28:02,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:04,157 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-18 17:28:04,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:04,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 97 [2019-01-18 17:28:04,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:04,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:28:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:28:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4039, Invalid=5467, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:28:04,178 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2019-01-18 17:28:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:05,662 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-01-18 17:28:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:28:05,663 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2019-01-18 17:28:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:05,663 INFO L225 Difference]: With dead ends: 166 [2019-01-18 17:28:05,663 INFO L226 Difference]: Without dead ends: 165 [2019-01-18 17:28:05,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6612, Invalid=9900, Unknown=0, NotChecked=0, Total=16512 [2019-01-18 17:28:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-18 17:28:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-01-18 17:28:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-18 17:28:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-01-18 17:28:05,691 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2019-01-18 17:28:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:05,692 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-01-18 17:28:05,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:28:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-01-18 17:28:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-18 17:28:05,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:05,693 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2019-01-18 17:28:05,693 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2019-01-18 17:28:05,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:05,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:05,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:06,816 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-18 17:28:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:06,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:06,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:06,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:06,817 INFO 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-18 17:28:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:06,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:06,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:06,931 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-18 17:28:06,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:06,939 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-18 17:28:06,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:07,697 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-18 17:28:07,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:09,210 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-18 17:28:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:09,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 100 [2019-01-18 17:28:09,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:09,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:28:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:28:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4297, Invalid=5803, Unknown=0, NotChecked=0, Total=10100 [2019-01-18 17:28:09,231 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2019-01-18 17:28:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:10,989 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-18 17:28:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:28:10,989 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2019-01-18 17:28:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:10,990 INFO L225 Difference]: With dead ends: 171 [2019-01-18 17:28:10,990 INFO L226 Difference]: Without dead ends: 170 [2019-01-18 17:28:10,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7033, Invalid=10523, Unknown=0, NotChecked=0, Total=17556 [2019-01-18 17:28:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-18 17:28:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-01-18 17:28:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-18 17:28:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-01-18 17:28:11,025 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2019-01-18 17:28:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:11,026 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-01-18 17:28:11,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:28:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-01-18 17:28:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-18 17:28:11,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:11,027 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2019-01-18 17:28:11,027 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2019-01-18 17:28:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:11,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:12,690 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-18 17:28:12,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:12,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:12,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:12,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:12,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:12,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:28:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:12,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:12,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-18 17:28:12,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:12,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:12,907 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-18 17:28:12,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:12,918 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-18 17:28:12,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:13,725 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-18 17:28:13,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:15,343 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-18 17:28:15,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:15,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2019-01-18 17:28:15,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:15,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:28:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:28:15,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=6149, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:28:15,364 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2019-01-18 17:28:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:17,113 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-01-18 17:28:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:28:17,113 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-01-18 17:28:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:17,114 INFO L225 Difference]: With dead ends: 176 [2019-01-18 17:28:17,114 INFO L226 Difference]: Without dead ends: 175 [2019-01-18 17:28:17,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5606 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7467, Invalid=11165, Unknown=0, NotChecked=0, Total=18632 [2019-01-18 17:28:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-18 17:28:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-01-18 17:28:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-18 17:28:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-01-18 17:28:17,150 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2019-01-18 17:28:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:17,151 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-01-18 17:28:17,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:28:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-01-18 17:28:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-18 17:28:17,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:17,152 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2019-01-18 17:28:17,152 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2019-01-18 17:28:17,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:17,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:17,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:18,583 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-18 17:28:18,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:18,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:18,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:18,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:18,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:18,584 INFO 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-18 17:28:18,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:18,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:18,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:18,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:18,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:18,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-18 17:28:18,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:18,783 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-18 17:28:18,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:19,633 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-18 17:28:19,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:21,474 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-18 17:28:21,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:21,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 106 [2019-01-18 17:28:21,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:21,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:28:21,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:28:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=6505, Unknown=0, NotChecked=0, Total=11342 [2019-01-18 17:28:21,495 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2019-01-18 17:28:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:22,975 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-01-18 17:28:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:28:22,975 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-01-18 17:28:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:22,976 INFO L225 Difference]: With dead ends: 181 [2019-01-18 17:28:22,976 INFO L226 Difference]: Without dead ends: 180 [2019-01-18 17:28:22,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7914, Invalid=11826, Unknown=0, NotChecked=0, Total=19740 [2019-01-18 17:28:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-18 17:28:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-01-18 17:28:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-18 17:28:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-18 17:28:23,003 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2019-01-18 17:28:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:23,003 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-18 17:28:23,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:28:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-18 17:28:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-18 17:28:23,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:23,005 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2019-01-18 17:28:23,005 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2019-01-18 17:28:23,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:23,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:23,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:23,963 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-18 17:28:23,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:23,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:23,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:23,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:23,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:23,964 INFO 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-18 17:28:23,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:23,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:24,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:24,106 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-18 17:28:24,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:24,185 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-18 17:28:24,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:25,150 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-18 17:28:25,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:27,378 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-18 17:28:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2019-01-18 17:28:27,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:27,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:28:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:28:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5119, Invalid=6871, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:27,398 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2019-01-18 17:28:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:29,140 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-01-18 17:28:29,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:28:29,141 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2019-01-18 17:28:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:29,142 INFO L225 Difference]: With dead ends: 186 [2019-01-18 17:28:29,142 INFO L226 Difference]: Without dead ends: 185 [2019-01-18 17:28:29,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6296 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8374, Invalid=12506, Unknown=0, NotChecked=0, Total=20880 [2019-01-18 17:28:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-18 17:28:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-01-18 17:28:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-18 17:28:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-01-18 17:28:29,179 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2019-01-18 17:28:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:29,179 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-01-18 17:28:29,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:28:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-01-18 17:28:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-18 17:28:29,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:29,180 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2019-01-18 17:28:29,181 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2019-01-18 17:28:29,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:29,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:29,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:30,210 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-18 17:28:30,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:30,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:30,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:30,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:30,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:30,211 INFO 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-18 17:28:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:30,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:30,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-18 17:28:30,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:30,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:30,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-18 17:28:30,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:30,549 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-18 17:28:30,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:31,926 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-18 17:28:31,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:33,756 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-18 17:28:33,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:33,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 112 [2019-01-18 17:28:33,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:33,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:28:33,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:28:33,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5409, Invalid=7247, Unknown=0, NotChecked=0, Total=12656 [2019-01-18 17:28:33,777 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2019-01-18 17:28:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:35,387 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-18 17:28:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:28:35,389 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2019-01-18 17:28:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:35,390 INFO L225 Difference]: With dead ends: 191 [2019-01-18 17:28:35,390 INFO L226 Difference]: Without dead ends: 190 [2019-01-18 17:28:35,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8847, Invalid=13205, Unknown=0, NotChecked=0, Total=22052 [2019-01-18 17:28:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-18 17:28:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-01-18 17:28:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-18 17:28:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-01-18 17:28:35,421 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2019-01-18 17:28:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:35,421 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-01-18 17:28:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:28:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-01-18 17:28:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-18 17:28:35,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:35,422 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2019-01-18 17:28:35,422 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2019-01-18 17:28:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:35,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:35,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:36,553 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-18 17:28:36,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:36,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:36,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:36,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:36,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:36,553 INFO 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-18 17:28:36,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:36,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:36,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:36,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:36,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:36,705 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-18 17:28:36,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:36,720 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-18 17:28:36,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:38,176 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-18 17:28:38,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:40,232 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-18 17:28:40,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:40,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 115 [2019-01-18 17:28:40,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:40,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:28:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:28:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5707, Invalid=7633, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:28:40,253 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2019-01-18 17:28:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:42,148 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-01-18 17:28:42,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:28:42,149 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2019-01-18 17:28:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:42,150 INFO L225 Difference]: With dead ends: 196 [2019-01-18 17:28:42,150 INFO L226 Difference]: Without dead ends: 195 [2019-01-18 17:28:42,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9333, Invalid=13923, Unknown=0, NotChecked=0, Total=23256 [2019-01-18 17:28:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-18 17:28:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-01-18 17:28:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-18 17:28:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-01-18 17:28:42,179 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2019-01-18 17:28:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-01-18 17:28:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:28:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-01-18 17:28:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-18 17:28:42,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:42,180 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2019-01-18 17:28:42,180 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2019-01-18 17:28:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:42,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:42,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:43,209 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-18 17:28:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:43,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:43,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:43,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:43,209 INFO 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-18 17:28:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:43,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:43,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:43,342 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-18 17:28:43,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:43,352 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-18 17:28:43,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:44,408 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-18 17:28:44,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:46,635 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-18 17:28:46,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:46,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2019-01-18 17:28:46,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:46,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:28:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:28:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=8029, Unknown=0, NotChecked=0, Total=14042 [2019-01-18 17:28:46,656 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2019-01-18 17:28:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:48,384 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-01-18 17:28:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:28:48,384 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2019-01-18 17:28:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:48,385 INFO L225 Difference]: With dead ends: 201 [2019-01-18 17:28:48,386 INFO L226 Difference]: Without dead ends: 200 [2019-01-18 17:28:48,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9832, Invalid=14660, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 17:28:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-18 17:28:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-01-18 17:28:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-18 17:28:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-18 17:28:48,415 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2019-01-18 17:28:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:48,415 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-18 17:28:48,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:28:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-18 17:28:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-18 17:28:48,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:48,416 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2019-01-18 17:28:48,416 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2019-01-18 17:28:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:48,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:49,850 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-18 17:28:49,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:49,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:49,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:49,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:49,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:49,851 INFO 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-18 17:28:49,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:49,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:50,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-18 17:28:50,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:50,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:50,104 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-18 17:28:50,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:50,113 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-18 17:28:50,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:51,225 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-18 17:28:51,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:53,500 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-18 17:28:53,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:53,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 121 [2019-01-18 17:28:53,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:53,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:28:53,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:28:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6327, Invalid=8435, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:28:53,521 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2019-01-18 17:28:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:55,307 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-01-18 17:28:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:28:55,307 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2019-01-18 17:28:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:55,308 INFO L225 Difference]: With dead ends: 206 [2019-01-18 17:28:55,308 INFO L226 Difference]: Without dead ends: 205 [2019-01-18 17:28:55,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10344, Invalid=15416, Unknown=0, NotChecked=0, Total=25760 [2019-01-18 17:28:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-18 17:28:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-01-18 17:28:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-18 17:28:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-01-18 17:28:55,341 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2019-01-18 17:28:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:55,341 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-01-18 17:28:55,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:28:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-01-18 17:28:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-18 17:28:55,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:55,342 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2019-01-18 17:28:55,342 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:28:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2019-01-18 17:28:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:55,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:55,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:56,310 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-18 17:28:56,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:56,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:56,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:56,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:56,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:56,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:28:56,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:56,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:56,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:56,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:56,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:56,461 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-18 17:28:56,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:56,470 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-18 17:28:56,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:28:57,843 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-18 17:28:57,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:00,230 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-18 17:29:00,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:00,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 124 [2019-01-18 17:29:00,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:00,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 17:29:00,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 17:29:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6649, Invalid=8851, Unknown=0, NotChecked=0, Total=15500 [2019-01-18 17:29:00,252 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2019-01-18 17:29:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:02,365 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-18 17:29:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:29:02,365 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2019-01-18 17:29:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:02,366 INFO L225 Difference]: With dead ends: 211 [2019-01-18 17:29:02,366 INFO L226 Difference]: Without dead ends: 210 [2019-01-18 17:29:02,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10869, Invalid=16191, Unknown=0, NotChecked=0, Total=27060 [2019-01-18 17:29:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-18 17:29:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-01-18 17:29:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-18 17:29:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-01-18 17:29:02,398 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2019-01-18 17:29:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:02,399 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-01-18 17:29:02,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 17:29:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-01-18 17:29:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-18 17:29:02,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:02,399 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2019-01-18 17:29:02,400 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:02,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2019-01-18 17:29:02,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:02,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:02,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:03,469 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-18 17:29:03,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:03,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:03,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:03,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:03,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:03,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 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-18 17:29:03,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:03,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:03,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:03,640 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-18 17:29:03,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:03,712 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-18 17:29:03,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:04,893 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-18 17:29:04,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:07,485 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-18 17:29:07,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:07,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 127 [2019-01-18 17:29:07,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:07,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:29:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:29:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6979, Invalid=9277, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:29:07,506 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2019-01-18 17:29:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:09,457 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-01-18 17:29:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:29:09,457 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2019-01-18 17:29:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:09,458 INFO L225 Difference]: With dead ends: 216 [2019-01-18 17:29:09,458 INFO L226 Difference]: Without dead ends: 215 [2019-01-18 17:29:09,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11407, Invalid=16985, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 17:29:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-18 17:29:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-01-18 17:29:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-18 17:29:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-01-18 17:29:09,504 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2019-01-18 17:29:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:09,505 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-01-18 17:29:09,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:29:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-01-18 17:29:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-18 17:29:09,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:09,506 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2019-01-18 17:29:09,506 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:09,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2019-01-18 17:29:09,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:09,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:09,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:10,676 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-18 17:29:10,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:10,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:10,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:10,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:10,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:10,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:29:10,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:10,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:10,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-18 17:29:10,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:10,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:10,979 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-18 17:29:10,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:11,000 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-18 17:29:11,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:12,471 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-18 17:29:12,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:14,921 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-18 17:29:14,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:14,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2019-01-18 17:29:14,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:14,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:29:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:29:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7317, Invalid=9713, Unknown=0, NotChecked=0, Total=17030 [2019-01-18 17:29:14,943 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2019-01-18 17:29:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:16,974 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-01-18 17:29:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:29:16,974 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-01-18 17:29:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:16,975 INFO L225 Difference]: With dead ends: 221 [2019-01-18 17:29:16,975 INFO L226 Difference]: Without dead ends: 220 [2019-01-18 17:29:16,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=11958, Invalid=17798, Unknown=0, NotChecked=0, Total=29756 [2019-01-18 17:29:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-18 17:29:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-01-18 17:29:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-18 17:29:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-18 17:29:17,020 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2019-01-18 17:29:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:17,020 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-18 17:29:17,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:29:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-18 17:29:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-18 17:29:17,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:17,021 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2019-01-18 17:29:17,021 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2019-01-18 17:29:17,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:17,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:17,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:17,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:17,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:18,243 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-18 17:29:18,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:18,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:18,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:18,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:18,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:18,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:29:18,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:18,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:18,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:18,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:18,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:18,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-18 17:29:18,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:18,417 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-18 17:29:18,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:19,669 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-18 17:29:19,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:22,700 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-18 17:29:22,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:22,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 133 [2019-01-18 17:29:22,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:22,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 17:29:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 17:29:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=10159, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:29:22,722 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2019-01-18 17:29:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:24,883 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-01-18 17:29:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:29:24,883 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2019-01-18 17:29:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:24,884 INFO L225 Difference]: With dead ends: 226 [2019-01-18 17:29:24,884 INFO L226 Difference]: Without dead ends: 225 [2019-01-18 17:29:24,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12522, Invalid=18630, Unknown=0, NotChecked=0, Total=31152 [2019-01-18 17:29:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-18 17:29:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-01-18 17:29:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-18 17:29:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-01-18 17:29:24,922 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2019-01-18 17:29:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:24,922 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-01-18 17:29:24,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 17:29:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-01-18 17:29:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-18 17:29:24,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:24,923 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2019-01-18 17:29:24,924 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2019-01-18 17:29:24,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:24,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:24,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:26,300 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-18 17:29:26,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:26,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:26,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:26,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:26,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:26,301 INFO 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-18 17:29:26,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:26,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:26,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:26,458 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-18 17:29:26,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:26,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-18 17:29:26,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:27,901 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-18 17:29:27,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:30,587 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-18 17:29:30,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:30,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 136 [2019-01-18 17:29:30,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:30,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:29:30,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:29:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8017, Invalid=10615, Unknown=0, NotChecked=0, Total=18632 [2019-01-18 17:29:30,609 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2019-01-18 17:29:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:33,191 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-18 17:29:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:29:33,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2019-01-18 17:29:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:33,192 INFO L225 Difference]: With dead ends: 231 [2019-01-18 17:29:33,192 INFO L226 Difference]: Without dead ends: 230 [2019-01-18 17:29:33,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9896 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=13099, Invalid=19481, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 17:29:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-18 17:29:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-18 17:29:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-18 17:29:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-01-18 17:29:33,249 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2019-01-18 17:29:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:33,249 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-01-18 17:29:33,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:29:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-01-18 17:29:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-18 17:29:33,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:33,251 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2019-01-18 17:29:33,251 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2019-01-18 17:29:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:33,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:33,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:34,677 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-18 17:29:34,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:34,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:34,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:34,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:34,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:34,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 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-18 17:29:34,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:34,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:34,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-18 17:29:34,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:34,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:34,982 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-18 17:29:34,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:34,993 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-18 17:29:34,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:36,393 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-18 17:29:36,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:39,389 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-18 17:29:39,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:39,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 139 [2019-01-18 17:29:39,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:39,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 17:29:39,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 17:29:39,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8379, Invalid=11081, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:29:39,411 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2019-01-18 17:29:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:41,763 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-01-18 17:29:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:29:41,764 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2019-01-18 17:29:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:41,765 INFO L225 Difference]: With dead ends: 236 [2019-01-18 17:29:41,765 INFO L226 Difference]: Without dead ends: 235 [2019-01-18 17:29:41,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10346 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=13689, Invalid=20351, Unknown=0, NotChecked=0, Total=34040 [2019-01-18 17:29:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-18 17:29:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-01-18 17:29:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-18 17:29:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-01-18 17:29:41,819 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2019-01-18 17:29:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:41,819 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-01-18 17:29:41,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 17:29:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-01-18 17:29:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-18 17:29:41,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:41,821 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2019-01-18 17:29:41,821 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2019-01-18 17:29:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:41,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:41,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:43,271 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-18 17:29:43,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:43,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:43,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:43,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:43,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:43,272 INFO 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-18 17:29:43,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:43,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:43,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:43,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:43,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:43,458 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-18 17:29:43,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:43,466 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-18 17:29:43,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:44,934 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-18 17:29:44,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:48,098 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-18 17:29:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2019-01-18 17:29:48,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:48,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 17:29:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 17:29:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8749, Invalid=11557, Unknown=0, NotChecked=0, Total=20306 [2019-01-18 17:29:48,121 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2019-01-18 17:29:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:50,621 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-01-18 17:29:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:29:50,621 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-01-18 17:29:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:50,622 INFO L225 Difference]: With dead ends: 241 [2019-01-18 17:29:50,622 INFO L226 Difference]: Without dead ends: 240 [2019-01-18 17:29:50,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10806 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=14292, Invalid=21240, Unknown=0, NotChecked=0, Total=35532 [2019-01-18 17:29:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-18 17:29:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-01-18 17:29:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-18 17:29:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-18 17:29:50,680 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2019-01-18 17:29:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:50,681 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-18 17:29:50,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 17:29:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-18 17:29:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-18 17:29:50,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:50,683 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2019-01-18 17:29:50,683 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:29:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2019-01-18 17:29:50,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:50,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:50,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:52,186 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-18 17:29:52,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:52,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:52,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:52,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:52,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:52,187 INFO 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-18 17:29:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:52,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:52,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:52,359 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-18 17:29:52,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:52,370 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-18 17:29:52,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:29:54,243 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-18 17:29:54,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:57,349 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-18 17:29:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:57,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 145 [2019-01-18 17:29:57,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:57,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 17:29:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 17:29:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=12043, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:29:57,371 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2019-01-18 17:30:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:00,012 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-01-18 17:30:00,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:30:00,012 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2019-01-18 17:30:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:00,013 INFO L225 Difference]: With dead ends: 246 [2019-01-18 17:30:00,014 INFO L226 Difference]: Without dead ends: 245 [2019-01-18 17:30:00,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11276 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14908, Invalid=22148, Unknown=0, NotChecked=0, Total=37056 [2019-01-18 17:30:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-18 17:30:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-01-18 17:30:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-18 17:30:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-01-18 17:30:00,056 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2019-01-18 17:30:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:00,056 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-01-18 17:30:00,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 17:30:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-01-18 17:30:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-18 17:30:00,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:00,057 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2019-01-18 17:30:00,057 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:30:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2019-01-18 17:30:00,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:00,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:00,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:01,391 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-18 17:30:01,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:01,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:01,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:01,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:01,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:01,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:30:01,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:01,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:01,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-18 17:30:01,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:01,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:01,726 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-18 17:30:01,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:01,736 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-18 17:30:01,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:30:03,539 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-18 17:30:03,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:06,690 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-18 17:30:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 148 [2019-01-18 17:30:06,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:06,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 17:30:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 17:30:06,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9513, Invalid=12539, Unknown=0, NotChecked=0, Total=22052 [2019-01-18 17:30:06,713 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2019-01-18 17:30:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:09,402 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-18 17:30:09,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:30:09,402 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2019-01-18 17:30:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:09,403 INFO L225 Difference]: With dead ends: 251 [2019-01-18 17:30:09,403 INFO L226 Difference]: Without dead ends: 250 [2019-01-18 17:30:09,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11756 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=15537, Invalid=23075, Unknown=0, NotChecked=0, Total=38612 [2019-01-18 17:30:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-18 17:30:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-01-18 17:30:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-18 17:30:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-01-18 17:30:09,454 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2019-01-18 17:30:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:09,454 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-01-18 17:30:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 17:30:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-01-18 17:30:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-18 17:30:09,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:09,455 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2019-01-18 17:30:09,455 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:30:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2019-01-18 17:30:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:09,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:09,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:10,802 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-18 17:30:10,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:10,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:10,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:10,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:10,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:10,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:30:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:10,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:10,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:10,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:10,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:10,989 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-18 17:30:10,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:10,998 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-18 17:30:10,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:30:12,632 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-18 17:30:12,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:16,150 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-18 17:30:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-18 17:30:16,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:16,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 17:30:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 17:30:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9907, Invalid=13045, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:30:16,171 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2019-01-18 17:30:18,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:18,942 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2019-01-18 17:30:18,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:30:18,943 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2019-01-18 17:30:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:18,944 INFO L225 Difference]: With dead ends: 256 [2019-01-18 17:30:18,944 INFO L226 Difference]: Without dead ends: 255 [2019-01-18 17:30:18,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12246 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=16179, Invalid=24021, Unknown=0, NotChecked=0, Total=40200 [2019-01-18 17:30:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-18 17:30:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-01-18 17:30:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-18 17:30:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-01-18 17:30:18,992 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2019-01-18 17:30:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:18,992 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-01-18 17:30:18,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 17:30:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-01-18 17:30:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-18 17:30:18,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:18,994 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2019-01-18 17:30:18,994 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:30:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2019-01-18 17:30:18,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:18,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:18,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:20,438 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-18 17:30:20,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:20,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:20,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:20,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:20,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:20,439 INFO 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-18 17:30:20,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:20,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:20,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:20,612 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-18 17:30:20,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:20,620 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-18 17:30:20,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:30:22,292 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-18 17:30:22,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:25,890 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-18 17:30:25,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:25,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-18 17:30:25,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:25,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 17:30:25,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 17:30:25,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10309, Invalid=13561, Unknown=0, NotChecked=0, Total=23870 [2019-01-18 17:30:25,912 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2019-01-18 17:30:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:28,589 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-01-18 17:30:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:30:28,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2019-01-18 17:30:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:28,591 INFO L225 Difference]: With dead ends: 261 [2019-01-18 17:30:28,591 INFO L226 Difference]: Without dead ends: 260 [2019-01-18 17:30:28,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12746 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=16834, Invalid=24986, Unknown=0, NotChecked=0, Total=41820 [2019-01-18 17:30:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-18 17:30:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-01-18 17:30:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-18 17:30:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-18 17:30:28,661 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2019-01-18 17:30:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:28,661 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-18 17:30:28,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 17:30:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-18 17:30:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-18 17:30:28,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:28,663 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2019-01-18 17:30:28,663 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:30:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2019-01-18 17:30:28,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:28,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:28,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:30,253 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-18 17:30:30,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:30,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:30,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:30,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:30,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:30,254 INFO 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-18 17:30:30,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:30,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:30,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-18 17:30:30,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:30,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:30,617 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-18 17:30:30,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:30,625 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-18 17:30:30,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:30:32,344 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-18 17:30:32,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:36,050 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-18 17:30:36,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:36,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-18 17:30:36,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:36,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 17:30:36,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 17:30:36,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10412, Invalid=13768, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:30:36,073 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2019-01-18 17:30:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:39,284 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-01-18 17:30:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:30:39,284 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2019-01-18 17:30:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:39,285 INFO L225 Difference]: With dead ends: 266 [2019-01-18 17:30:39,285 INFO L226 Difference]: Without dead ends: 265 [2019-01-18 17:30:39,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13347 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17093, Invalid=25549, Unknown=0, NotChecked=0, Total=42642 [2019-01-18 17:30:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-18 17:30:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-01-18 17:30:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-18 17:30:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-01-18 17:30:39,334 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2019-01-18 17:30:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:39,335 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-01-18 17:30:39,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 17:30:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-01-18 17:30:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-18 17:30:39,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:39,336 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2019-01-18 17:30:39,336 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:30:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2019-01-18 17:30:39,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:39,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:39,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:40,866 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-18 17:30:40,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:40,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:40,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:40,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:40,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:40,867 INFO 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-18 17:30:40,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:40,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:41,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:41,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:41,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:41,058 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-18 17:30:41,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:41,067 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-18 17:30:41,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:30:42,851 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-18 17:30:42,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:46,613 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-18 17:30:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:46,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-18 17:30:46,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:46,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-18 17:30:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-18 17:30:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10515, Invalid=13977, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 17:30:46,635 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2019-01-18 17:30:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:49,738 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-18 17:30:49,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:30:49,739 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2019-01-18 17:30:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:49,740 INFO L225 Difference]: With dead ends: 271 [2019-01-18 17:30:49,740 INFO L226 Difference]: Without dead ends: 270 [2019-01-18 17:30:49,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13950 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17353, Invalid=26119, Unknown=0, NotChecked=0, Total=43472 [2019-01-18 17:30:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-18 17:30:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-01-18 17:30:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-18 17:30:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-01-18 17:30:49,791 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2019-01-18 17:30:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:49,792 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-01-18 17:30:49,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-18 17:30:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-01-18 17:30:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-18 17:30:49,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:49,793 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2019-01-18 17:30:49,793 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:30:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2019-01-18 17:30:49,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:49,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:49,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:51,320 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-18 17:30:51,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:51,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:51,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:51,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:51,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:51,321 INFO 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-18 17:30:51,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:51,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:51,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:51,508 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-18 17:30:51,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,521 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-18 17:30:51,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:30:53,397 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-18 17:30:53,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:57,218 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-18 17:30:57,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:57,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-18 17:30:57,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:57,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-18 17:30:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-18 17:30:57,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10618, Invalid=14188, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:30:57,239 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2019-01-18 17:31:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:00,474 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-01-18 17:31:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:31:00,475 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2019-01-18 17:31:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:00,476 INFO L225 Difference]: With dead ends: 276 [2019-01-18 17:31:00,476 INFO L226 Difference]: Without dead ends: 275 [2019-01-18 17:31:00,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 423 SyntacticMatches, 6 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14555 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17614, Invalid=26696, Unknown=0, NotChecked=0, Total=44310 [2019-01-18 17:31:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-18 17:31:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-01-18 17:31:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-01-18 17:31:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-01-18 17:31:00,554 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2019-01-18 17:31:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:00,555 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-01-18 17:31:00,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-18 17:31:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-01-18 17:31:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-18 17:31:00,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:00,556 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2019-01-18 17:31:00,557 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:31:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2019-01-18 17:31:00,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:00,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:00,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:02,222 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-18 17:31:02,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:02,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:02,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:02,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:02,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:02,223 INFO 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-18 17:31:02,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:02,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:02,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-18 17:31:02,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:02,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:02,644 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-18 17:31:02,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:02,654 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-18 17:31:02,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:31:04,741 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-18 17:31:04,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:08,480 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-18 17:31:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:08,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-18 17:31:08,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-18 17:31:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-18 17:31:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10721, Invalid=14401, Unknown=0, NotChecked=0, Total=25122 [2019-01-18 17:31:08,502 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2019-01-18 17:31:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:11,849 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-01-18 17:31:11,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:31:11,849 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2019-01-18 17:31:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:11,850 INFO L225 Difference]: With dead ends: 281 [2019-01-18 17:31:11,850 INFO L226 Difference]: Without dead ends: 280 [2019-01-18 17:31:11,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 431 SyntacticMatches, 8 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15162 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17876, Invalid=27280, Unknown=0, NotChecked=0, Total=45156 [2019-01-18 17:31:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-18 17:31:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-01-18 17:31:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-18 17:31:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-18 17:31:11,920 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2019-01-18 17:31:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:11,920 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-18 17:31:11,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-18 17:31:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-18 17:31:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-18 17:31:11,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:11,922 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2019-01-18 17:31:11,922 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:31:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2019-01-18 17:31:11,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:11,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:11,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:13,561 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-18 17:31:13,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:13,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:13,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:13,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:13,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:13,562 INFO 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-18 17:31:13,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:13,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:13,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:13,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:13,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:13,763 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-18 17:31:13,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:13,773 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-18 17:31:13,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:31:16,096 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-18 17:31:16,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:19,722 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-18 17:31:19,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-18 17:31:19,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:19,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-18 17:31:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-18 17:31:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10824, Invalid=14616, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:31:19,745 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2019-01-18 17:31:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:23,190 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-01-18 17:31:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:31:23,191 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2019-01-18 17:31:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:23,192 INFO L225 Difference]: With dead ends: 286 [2019-01-18 17:31:23,192 INFO L226 Difference]: Without dead ends: 285 [2019-01-18 17:31:23,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 439 SyntacticMatches, 10 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15771 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18139, Invalid=27871, Unknown=0, NotChecked=0, Total=46010 [2019-01-18 17:31:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-18 17:31:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-01-18 17:31:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-18 17:31:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-01-18 17:31:23,278 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2019-01-18 17:31:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:23,279 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2019-01-18 17:31:23,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-18 17:31:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2019-01-18 17:31:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-18 17:31:23,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:23,280 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2019-01-18 17:31:23,280 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:31:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2019-01-18 17:31:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:23,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:23,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:24,964 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-18 17:31:24,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:24,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:24,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:24,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:24,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:24,965 INFO 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-18 17:31:24,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:24,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:25,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:25,160 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-18 17:31:25,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,171 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-18 17:31:25,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:31:27,391 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-18 17:31:27,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:31,351 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-18 17:31:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-18 17:31:31,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:31,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-18 17:31:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-18 17:31:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10927, Invalid=14833, Unknown=0, NotChecked=0, Total=25760 [2019-01-18 17:31:31,372 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2019-01-18 17:31:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:34,634 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-18 17:31:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:31:34,635 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2019-01-18 17:31:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:34,636 INFO L225 Difference]: With dead ends: 291 [2019-01-18 17:31:34,636 INFO L226 Difference]: Without dead ends: 290 [2019-01-18 17:31:34,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16382 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=18403, Invalid=28469, Unknown=0, NotChecked=0, Total=46872 [2019-01-18 17:31:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-18 17:31:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-01-18 17:31:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-18 17:31:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-01-18 17:31:34,697 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2019-01-18 17:31:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:34,697 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-01-18 17:31:34,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-18 17:31:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-01-18 17:31:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-18 17:31:34,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:34,698 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2019-01-18 17:31:34,698 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:31:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2019-01-18 17:31:34,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:34,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:36,788 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-18 17:31:36,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:36,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:36,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:36,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:36,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:36,789 INFO 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-18 17:31:36,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:36,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:37,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-18 17:31:37,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:37,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:37,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-18 17:31:37,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,246 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-18 17:31:37,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:31:39,355 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-18 17:31:39,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:43,268 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-18 17:31:43,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:43,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-18 17:31:43,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:43,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-18 17:31:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-18 17:31:43,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11030, Invalid=15052, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:31:43,291 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2019-01-18 17:31:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:46,918 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-01-18 17:31:46,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:31:46,918 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2019-01-18 17:31:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:46,920 INFO L225 Difference]: With dead ends: 296 [2019-01-18 17:31:46,920 INFO L226 Difference]: Without dead ends: 295 [2019-01-18 17:31:46,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 455 SyntacticMatches, 14 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16995 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18668, Invalid=29074, Unknown=0, NotChecked=0, Total=47742 [2019-01-18 17:31:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-18 17:31:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-01-18 17:31:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-18 17:31:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-01-18 17:31:46,987 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2019-01-18 17:31:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:46,988 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-01-18 17:31:46,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-18 17:31:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-01-18 17:31:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-18 17:31:46,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:46,989 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2019-01-18 17:31:46,989 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:31:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2019-01-18 17:31:46,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:46,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:46,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:48,822 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-18 17:31:48,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:48,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:48,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:48,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:48,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:48,823 INFO 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-18 17:31:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:48,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:49,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:49,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:49,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:49,041 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-18 17:31:49,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,050 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-18 17:31:49,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:31:51,528 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-18 17:31:51,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:55,402 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-18 17:31:55,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-18 17:31:55,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:55,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-18 17:31:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-18 17:31:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11133, Invalid=15273, Unknown=0, NotChecked=0, Total=26406 [2019-01-18 17:31:55,425 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2019-01-18 17:31:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:58,996 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-01-18 17:31:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:31:58,997 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2019-01-18 17:31:58,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:58,998 INFO L225 Difference]: With dead ends: 301 [2019-01-18 17:31:58,998 INFO L226 Difference]: Without dead ends: 300 [2019-01-18 17:31:59,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 463 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17610 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=18934, Invalid=29686, Unknown=0, NotChecked=0, Total=48620 [2019-01-18 17:31:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-18 17:31:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-01-18 17:31:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-18 17:31:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-18 17:31:59,066 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2019-01-18 17:31:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:59,067 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-18 17:31:59,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-18 17:31:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-18 17:31:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-18 17:31:59,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:59,068 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2019-01-18 17:31:59,068 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:31:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2019-01-18 17:31:59,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:59,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:59,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:59,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:00,997 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-18 17:32:00,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:00,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:00,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:00,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:00,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:00,998 INFO 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-18 17:32:01,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:01,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:01,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:01,202 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-18 17:32:01,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,212 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-18 17:32:01,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:32:03,503 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-18 17:32:03,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:07,607 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-18 17:32:07,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:07,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-18 17:32:07,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:07,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-18 17:32:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-18 17:32:07,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11236, Invalid=15496, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:32:07,629 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2019-01-18 17:32:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:11,141 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-01-18 17:32:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:32:11,142 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2019-01-18 17:32:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:11,143 INFO L225 Difference]: With dead ends: 306 [2019-01-18 17:32:11,144 INFO L226 Difference]: Without dead ends: 305 [2019-01-18 17:32:11,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 471 SyntacticMatches, 18 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19201, Invalid=30305, Unknown=0, NotChecked=0, Total=49506 [2019-01-18 17:32:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-18 17:32:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-01-18 17:32:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-01-18 17:32:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-01-18 17:32:11,217 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2019-01-18 17:32:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:11,217 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-01-18 17:32:11,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-18 17:32:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-01-18 17:32:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-18 17:32:11,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:11,218 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2019-01-18 17:32:11,219 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:32:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2019-01-18 17:32:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:11,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:13,178 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-18 17:32:13,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:13,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:13,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:13,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:13,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:13,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:32:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:13,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:13,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-18 17:32:13,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:13,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:13,641 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-18 17:32:13,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,649 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-18 17:32:13,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:32:15,953 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-18 17:32:15,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:19,954 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-18 17:32:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-18 17:32:19,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:19,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-18 17:32:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-18 17:32:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11339, Invalid=15721, Unknown=0, NotChecked=0, Total=27060 [2019-01-18 17:32:19,977 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2019-01-18 17:32:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:23,676 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-18 17:32:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:32:23,683 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2019-01-18 17:32:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:23,684 INFO L225 Difference]: With dead ends: 311 [2019-01-18 17:32:23,685 INFO L226 Difference]: Without dead ends: 310 [2019-01-18 17:32:23,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 479 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19469, Invalid=30931, Unknown=0, NotChecked=0, Total=50400 [2019-01-18 17:32:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-18 17:32:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-01-18 17:32:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-18 17:32:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-01-18 17:32:23,755 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2019-01-18 17:32:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:23,755 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-01-18 17:32:23,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-18 17:32:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-01-18 17:32:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-01-18 17:32:23,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:23,756 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2019-01-18 17:32:23,756 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:32:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2019-01-18 17:32:23,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:23,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:23,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:23,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:23,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:25,789 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-18 17:32:25,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:25,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:25,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:25,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:25,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:25,789 INFO 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-18 17:32:25,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:32:25,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:32:26,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:32:26,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:26,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:26,018 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-18 17:32:26,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:26,028 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-18 17:32:26,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:32:28,706 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-18 17:32:28,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:32,878 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-18 17:32:32,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:32,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-18 17:32:32,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:32,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-18 17:32:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-18 17:32:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11442, Invalid=15948, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:32:32,900 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2019-01-18 17:32:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:36,643 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2019-01-18 17:32:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:32:36,644 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2019-01-18 17:32:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:36,646 INFO L225 Difference]: With dead ends: 316 [2019-01-18 17:32:36,646 INFO L226 Difference]: Without dead ends: 315 [2019-01-18 17:32:36,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 487 SyntacticMatches, 22 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19467 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19738, Invalid=31564, Unknown=0, NotChecked=0, Total=51302 [2019-01-18 17:32:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-18 17:32:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-01-18 17:32:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-18 17:32:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-01-18 17:32:36,722 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2019-01-18 17:32:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:36,722 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-01-18 17:32:36,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-18 17:32:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-01-18 17:32:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-18 17:32:36,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:36,723 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2019-01-18 17:32:36,724 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:32:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2019-01-18 17:32:36,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:36,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:36,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:38,854 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-18 17:32:38,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:38,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:38,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:38,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:38,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:38,855 INFO 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-18 17:32:38,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:38,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:39,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:39,069 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-18 17:32:39,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:39,083 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-18 17:32:39,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:32:41,535 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-18 17:32:41,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:45,803 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-18 17:32:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:45,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-18 17:32:45,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:45,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-18 17:32:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-18 17:32:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11545, Invalid=16177, Unknown=0, NotChecked=0, Total=27722 [2019-01-18 17:32:45,826 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2019-01-18 17:32:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:49,848 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-01-18 17:32:49,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:32:49,848 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2019-01-18 17:32:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:49,850 INFO L225 Difference]: With dead ends: 321 [2019-01-18 17:32:49,850 INFO L226 Difference]: Without dead ends: 320 [2019-01-18 17:32:49,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 495 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20090 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=20008, Invalid=32204, Unknown=0, NotChecked=0, Total=52212 [2019-01-18 17:32:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-18 17:32:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2019-01-18 17:32:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-18 17:32:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-18 17:32:49,922 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2019-01-18 17:32:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:49,922 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-18 17:32:49,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-18 17:32:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-18 17:32:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-18 17:32:49,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:49,924 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2019-01-18 17:32:49,924 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:32:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2019-01-18 17:32:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:49,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:52,031 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-18 17:32:52,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:52,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:52,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:52,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:52,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:52,032 INFO 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-18 17:32:52,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:52,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:52,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-18 17:32:52,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:52,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:52,543 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-18 17:32:52,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:52,555 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-18 17:32:52,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:32:55,113 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-18 17:32:55,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:59,293 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-18 17:32:59,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:59,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-18 17:32:59,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:59,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-18 17:32:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-18 17:32:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11648, Invalid=16408, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:32:59,316 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2019-01-18 17:33:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:03,323 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-01-18 17:33:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:33:03,324 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2019-01-18 17:33:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:03,325 INFO L225 Difference]: With dead ends: 326 [2019-01-18 17:33:03,325 INFO L226 Difference]: Without dead ends: 325 [2019-01-18 17:33:03,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 503 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20715 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20279, Invalid=32851, Unknown=0, NotChecked=0, Total=53130 [2019-01-18 17:33:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-18 17:33:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-01-18 17:33:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-18 17:33:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-01-18 17:33:03,399 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2019-01-18 17:33:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:03,399 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-01-18 17:33:03,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-18 17:33:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-01-18 17:33:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-18 17:33:03,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:03,401 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2019-01-18 17:33:03,401 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:33:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2019-01-18 17:33:03,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:03,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:03,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:03,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:03,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:05,617 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-18 17:33:05,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:05,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:05,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:05,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:05,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:05,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 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-18 17:33:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:33:05,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:33:05,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:33:05,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:05,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:05,860 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-18 17:33:05,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:05,868 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-18 17:33:05,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:33:08,747 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-18 17:33:08,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:12,748 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-18 17:33:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:12,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-18 17:33:12,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:12,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-18 17:33:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-18 17:33:12,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11751, Invalid=16641, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 17:33:12,770 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2019-01-18 17:33:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:16,747 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-18 17:33:16,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:33:16,748 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2019-01-18 17:33:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:16,749 INFO L225 Difference]: With dead ends: 331 [2019-01-18 17:33:16,749 INFO L226 Difference]: Without dead ends: 330 [2019-01-18 17:33:16,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 511 SyntacticMatches, 28 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21342 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20551, Invalid=33505, Unknown=0, NotChecked=0, Total=54056 [2019-01-18 17:33:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-18 17:33:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-01-18 17:33:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-18 17:33:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-01-18 17:33:16,854 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2019-01-18 17:33:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:16,854 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-01-18 17:33:16,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-18 17:33:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-01-18 17:33:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-18 17:33:16,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:16,856 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2019-01-18 17:33:16,856 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:33:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2019-01-18 17:33:16,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:16,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:16,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:19,365 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-18 17:33:19,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:19,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:19,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:19,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:19,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:19,366 INFO 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-18 17:33:19,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:19,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:33:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:19,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:19,592 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-18 17:33:19,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:19,604 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-18 17:33:19,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:33:22,345 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-18 17:33:22,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:26,635 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-18 17:33:26,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:26,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-18 17:33:26,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:26,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-18 17:33:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-18 17:33:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11854, Invalid=16876, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:33:26,658 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2019-01-18 17:33:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:31,093 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-01-18 17:33:31,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:33:31,093 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2019-01-18 17:33:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:31,095 INFO L225 Difference]: With dead ends: 336 [2019-01-18 17:33:31,095 INFO L226 Difference]: Without dead ends: 335 [2019-01-18 17:33:31,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 519 SyntacticMatches, 30 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21971 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=20824, Invalid=34166, Unknown=0, NotChecked=0, Total=54990 [2019-01-18 17:33:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-18 17:33:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-01-18 17:33:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-18 17:33:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2019-01-18 17:33:31,176 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2019-01-18 17:33:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:31,176 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2019-01-18 17:33:31,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-18 17:33:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2019-01-18 17:33:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-18 17:33:31,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:31,178 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2019-01-18 17:33:31,178 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:33:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2019-01-18 17:33:31,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:31,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:31,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:33,801 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-18 17:33:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:33,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:33,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:33,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:33,802 INFO 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-18 17:33:33,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:33:33,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:34,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-18 17:33:34,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:34,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:34,360 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-18 17:33:34,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:34,374 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-18 17:33:34,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:33:37,080 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-18 17:33:37,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:41,378 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-18 17:33:41,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:41,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-18 17:33:41,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:41,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-18 17:33:41,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-18 17:33:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=17113, Unknown=0, NotChecked=0, Total=29070 [2019-01-18 17:33:41,401 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2019-01-18 17:33:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:45,981 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-01-18 17:33:45,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:33:45,982 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2019-01-18 17:33:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:45,983 INFO L225 Difference]: With dead ends: 341 [2019-01-18 17:33:45,983 INFO L226 Difference]: Without dead ends: 340 [2019-01-18 17:33:45,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 527 SyntacticMatches, 32 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22602 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=21098, Invalid=34834, Unknown=0, NotChecked=0, Total=55932 [2019-01-18 17:33:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-01-18 17:33:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2019-01-18 17:33:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-18 17:33:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-18 17:33:46,066 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2019-01-18 17:33:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:46,067 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-18 17:33:46,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-18 17:33:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-18 17:33:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-18 17:33:46,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:46,068 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2019-01-18 17:33:46,068 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:33:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2019-01-18 17:33:46,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:46,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:46,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:48,877 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-18 17:33:48,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:48,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:48,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:48,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:48,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:48,877 INFO 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-18 17:33:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:33:48,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:33:49,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:33:49,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:49,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:49,122 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-18 17:33:49,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:49,131 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-18 17:33:49,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:33:51,976 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-18 17:33:51,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:56,705 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-18 17:33:56,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:56,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-18 17:33:56,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:56,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-18 17:33:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-18 17:33:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12060, Invalid=17352, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:33:56,727 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2019-01-18 17:34:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:01,359 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-01-18 17:34:01,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:34:01,360 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2019-01-18 17:34:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:01,361 INFO L225 Difference]: With dead ends: 346 [2019-01-18 17:34:01,361 INFO L226 Difference]: Without dead ends: 345 [2019-01-18 17:34:01,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 535 SyntacticMatches, 34 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23235 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21373, Invalid=35509, Unknown=0, NotChecked=0, Total=56882 [2019-01-18 17:34:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-18 17:34:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-01-18 17:34:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-18 17:34:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-01-18 17:34:01,456 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2019-01-18 17:34:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:01,456 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2019-01-18 17:34:01,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-18 17:34:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2019-01-18 17:34:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-18 17:34:01,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:01,457 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2019-01-18 17:34:01,457 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:34:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2019-01-18 17:34:01,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:01,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:01,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:04,108 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-18 17:34:04,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:04,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:04,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:04,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:04,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:04,108 INFO 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-18 17:34:04,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:04,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:04,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-18 17:34:04,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:04,352 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-18 17:34:04,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:34:07,330 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-18 17:34:07,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:11,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-18 17:34:11,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:11,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-18 17:34:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-18 17:34:11,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12163, Invalid=17593, Unknown=0, NotChecked=0, Total=29756 [2019-01-18 17:34:11,782 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2019-01-18 17:34:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:16,435 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-18 17:34:16,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:34:16,436 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2019-01-18 17:34:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:16,437 INFO L225 Difference]: With dead ends: 351 [2019-01-18 17:34:16,437 INFO L226 Difference]: Without dead ends: 350 [2019-01-18 17:34:16,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 543 SyntacticMatches, 36 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23870 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21649, Invalid=36191, Unknown=0, NotChecked=0, Total=57840 [2019-01-18 17:34:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-18 17:34:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-01-18 17:34:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-18 17:34:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-01-18 17:34:16,524 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2019-01-18 17:34:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:16,524 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-01-18 17:34:16,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-18 17:34:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-01-18 17:34:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-01-18 17:34:16,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:16,526 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2019-01-18 17:34:16,526 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:34:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:16,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2019-01-18 17:34:16,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:16,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:16,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:19,094 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-18 17:34:19,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:19,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:19,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:19,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:19,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:19,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:19,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:19,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:19,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-18 17:34:19,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:19,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:19,701 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-18 17:34:19,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:19,709 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-18 17:34:19,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:34:22,702 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-18 17:34:22,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:27,203 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-18 17:34:27,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-18 17:34:27,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:27,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-18 17:34:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-18 17:34:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12266, Invalid=17836, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:34:27,226 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2019-01-18 17:34:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:32,151 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2019-01-18 17:34:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:34:32,152 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2019-01-18 17:34:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:32,153 INFO L225 Difference]: With dead ends: 356 [2019-01-18 17:34:32,153 INFO L226 Difference]: Without dead ends: 355 [2019-01-18 17:34:32,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 551 SyntacticMatches, 38 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24507 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=21926, Invalid=36880, Unknown=0, NotChecked=0, Total=58806 [2019-01-18 17:34:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-01-18 17:34:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-01-18 17:34:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-18 17:34:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2019-01-18 17:34:32,243 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2019-01-18 17:34:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:32,243 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2019-01-18 17:34:32,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-18 17:34:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2019-01-18 17:34:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-01-18 17:34:32,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:32,245 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2019-01-18 17:34:32,245 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:34:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2019-01-18 17:34:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:35,069 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-18 17:34:35,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:35,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:35,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:35,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:35,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:35,069 INFO 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-18 17:34:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:35,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:35,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:35,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:35,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:35,328 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-18 17:34:35,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,336 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-18 17:34:35,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:34:38,411 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-18 17:34:38,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:42,881 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-18 17:34:42,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:42,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-18 17:34:42,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:42,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-18 17:34:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-18 17:34:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12369, Invalid=18081, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 17:34:42,904 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2019-01-18 17:34:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:47,783 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-01-18 17:34:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:34:47,783 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2019-01-18 17:34:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:47,785 INFO L225 Difference]: With dead ends: 361 [2019-01-18 17:34:47,785 INFO L226 Difference]: Without dead ends: 360 [2019-01-18 17:34:47,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 559 SyntacticMatches, 40 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25146 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22204, Invalid=37576, Unknown=0, NotChecked=0, Total=59780 [2019-01-18 17:34:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-01-18 17:34:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2019-01-18 17:34:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-18 17:34:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-18 17:34:47,879 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2019-01-18 17:34:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:47,880 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-18 17:34:47,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-18 17:34:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-18 17:34:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-18 17:34:47,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:47,881 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2019-01-18 17:34:47,881 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:34:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2019-01-18 17:34:47,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:47,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:47,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:47,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:51,152 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-18 17:34:51,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:51,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:51,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:51,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:51,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:51,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:51,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:51,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:51,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:51,393 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-18 17:34:51,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:51,403 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-18 17:34:51,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:34:54,583 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-18 17:34:54,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:59,090 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-18 17:34:59,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:59,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-18 17:34:59,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:59,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-18 17:34:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-18 17:34:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12472, Invalid=18328, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:34:59,112 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2019-01-18 17:35:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:04,097 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-01-18 17:35:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:35:04,097 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2019-01-18 17:35:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:04,099 INFO L225 Difference]: With dead ends: 366 [2019-01-18 17:35:04,099 INFO L226 Difference]: Without dead ends: 365 [2019-01-18 17:35:04,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 567 SyntacticMatches, 42 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25787 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=22483, Invalid=38279, Unknown=0, NotChecked=0, Total=60762 [2019-01-18 17:35:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-18 17:35:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-01-18 17:35:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-18 17:35:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-01-18 17:35:04,196 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2019-01-18 17:35:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:04,196 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2019-01-18 17:35:04,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-18 17:35:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2019-01-18 17:35:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-01-18 17:35:04,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:04,198 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2019-01-18 17:35:04,198 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:35:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2019-01-18 17:35:04,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:04,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:04,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:07,183 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-18 17:35:07,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:07,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:07,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:07,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:07,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:07,184 INFO 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-18 17:35:07,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:07,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:07,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-18 17:35:07,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:07,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:07,822 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-18 17:35:07,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,833 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-18 17:35:07,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:35:11,299 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-18 17:35:11,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:15,505 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-18 17:35:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:15,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-18 17:35:15,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:15,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-18 17:35:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-18 17:35:15,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12575, Invalid=18577, Unknown=0, NotChecked=0, Total=31152 [2019-01-18 17:35:15,528 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2019-01-18 17:35:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:20,529 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-18 17:35:20,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 17:35:20,529 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2019-01-18 17:35:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:20,531 INFO L225 Difference]: With dead ends: 371 [2019-01-18 17:35:20,531 INFO L226 Difference]: Without dead ends: 370 [2019-01-18 17:35:20,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 575 SyntacticMatches, 44 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26430 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22763, Invalid=38989, Unknown=0, NotChecked=0, Total=61752 [2019-01-18 17:35:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-18 17:35:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-01-18 17:35:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-18 17:35:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-01-18 17:35:20,628 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2019-01-18 17:35:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2019-01-18 17:35:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-18 17:35:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2019-01-18 17:35:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-18 17:35:20,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:20,630 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2019-01-18 17:35:20,630 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:35:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2019-01-18 17:35:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:20,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:20,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:20,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:23,358 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-18 17:35:23,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:23,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:23,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:23,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:23,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:23,358 INFO 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-18 17:35:23,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:35:23,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:35:23,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:35:23,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:23,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:23,627 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-18 17:35:23,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,639 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-18 17:35:23,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:35:27,223 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-18 17:35:27,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:31,811 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-18 17:35:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-18 17:35:31,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:31,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-18 17:35:31,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-18 17:35:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12678, Invalid=18828, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:35:31,834 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2019-01-18 17:35:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:37,090 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2019-01-18 17:35:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:35:37,090 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2019-01-18 17:35:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:37,092 INFO L225 Difference]: With dead ends: 376 [2019-01-18 17:35:37,092 INFO L226 Difference]: Without dead ends: 375 [2019-01-18 17:35:37,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 583 SyntacticMatches, 46 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27075 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23044, Invalid=39706, Unknown=0, NotChecked=0, Total=62750 [2019-01-18 17:35:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-01-18 17:35:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-01-18 17:35:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-18 17:35:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2019-01-18 17:35:37,192 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2019-01-18 17:35:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:37,192 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2019-01-18 17:35:37,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-18 17:35:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2019-01-18 17:35:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-18 17:35:37,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:37,194 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2019-01-18 17:35:37,194 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:35:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2019-01-18 17:35:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:37,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:37,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:40,098 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-18 17:35:40,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:40,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:40,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:40,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:40,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:40,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:40,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:40,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:40,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:40,349 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-18 17:35:40,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,357 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-18 17:35:40,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:35:44,084 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-18 17:35:44,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:48,570 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-18 17:35:48,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:48,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-18 17:35:48,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:48,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-18 17:35:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-18 17:35:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12781, Invalid=19081, Unknown=0, NotChecked=0, Total=31862 [2019-01-18 17:35:48,595 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2019-01-18 17:35:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:54,062 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2019-01-18 17:35:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 17:35:54,062 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2019-01-18 17:35:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:54,064 INFO L225 Difference]: With dead ends: 381 [2019-01-18 17:35:54,064 INFO L226 Difference]: Without dead ends: 380 [2019-01-18 17:35:54,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23326, Invalid=40430, Unknown=0, NotChecked=0, Total=63756 [2019-01-18 17:35:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-18 17:35:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-01-18 17:35:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-18 17:35:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-18 17:35:54,169 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2019-01-18 17:35:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:54,169 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-18 17:35:54,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-18 17:35:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-18 17:35:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-18 17:35:54,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:54,170 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2019-01-18 17:35:54,171 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:35:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2019-01-18 17:35:54,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:54,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:54,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:54,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:57,288 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-18 17:35:57,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:57,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:57,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:57,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:57,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:57,288 INFO 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-18 17:35:57,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:57,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:57,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-18 17:35:57,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:57,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:57,969 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-18 17:35:57,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:57,982 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-18 17:35:57,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:36:01,494 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-18 17:36:01,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:05,940 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-18 17:36:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:05,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-18 17:36:05,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:05,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-18 17:36:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-18 17:36:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12884, Invalid=19336, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:36:05,963 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2019-01-18 17:36:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:11,466 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-01-18 17:36:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:36:11,466 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2019-01-18 17:36:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:11,468 INFO L225 Difference]: With dead ends: 386 [2019-01-18 17:36:11,468 INFO L226 Difference]: Without dead ends: 385 [2019-01-18 17:36:11,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 599 SyntacticMatches, 50 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28371 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23609, Invalid=41161, Unknown=0, NotChecked=0, Total=64770 [2019-01-18 17:36:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-18 17:36:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-01-18 17:36:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-18 17:36:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-01-18 17:36:11,576 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2019-01-18 17:36:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:11,577 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2019-01-18 17:36:11,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-18 17:36:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2019-01-18 17:36:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-01-18 17:36:11,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:11,578 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2019-01-18 17:36:11,578 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:36:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2019-01-18 17:36:11,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:11,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:11,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:14,725 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-18 17:36:14,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:14,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:14,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:14,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:14,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:14,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 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-18 17:36:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:14,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:14,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:14,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:15,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:15,009 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-18 17:36:15,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,019 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-18 17:36:15,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:36:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:18,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:23,341 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-18 17:36:23,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:23,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-18 17:36:23,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:23,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-18 17:36:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-18 17:36:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12987, Invalid=19593, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 17:36:23,366 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2019-01-18 17:36:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:28,972 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-18 17:36:28,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:36:28,972 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2019-01-18 17:36:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:28,974 INFO L225 Difference]: With dead ends: 391 [2019-01-18 17:36:28,974 INFO L226 Difference]: Without dead ends: 390 [2019-01-18 17:36:28,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 607 SyntacticMatches, 52 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29022 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=23893, Invalid=41899, Unknown=0, NotChecked=0, Total=65792 [2019-01-18 17:36:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-18 17:36:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-01-18 17:36:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-01-18 17:36:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-01-18 17:36:29,083 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2019-01-18 17:36:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:29,083 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2019-01-18 17:36:29,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-18 17:36:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2019-01-18 17:36:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-01-18 17:36:29,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:29,084 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2019-01-18 17:36:29,085 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:36:29,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2019-01-18 17:36:29,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:29,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:29,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:29,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:29,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:32,313 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-18 17:36:32,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:32,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:32,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:32,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:32,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:32,313 INFO 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-18 17:36:32,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:32,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:32,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:32,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-18 17:36:32,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:32,581 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-18 17:36:32,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:36:36,296 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-18 17:36:36,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:40,861 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-18 17:36:40,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:40,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-18 17:36:40,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:40,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-18 17:36:40,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-18 17:36:40,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13090, Invalid=19852, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:36:40,883 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2019-01-18 17:36:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:46,684 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2019-01-18 17:36:46,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:36:46,684 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2019-01-18 17:36:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:46,686 INFO L225 Difference]: With dead ends: 396 [2019-01-18 17:36:46,686 INFO L226 Difference]: Without dead ends: 395 [2019-01-18 17:36:46,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 615 SyntacticMatches, 54 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29675 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=24178, Invalid=42644, Unknown=0, NotChecked=0, Total=66822 [2019-01-18 17:36:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-01-18 17:36:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-01-18 17:36:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-18 17:36:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2019-01-18 17:36:46,802 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2019-01-18 17:36:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:46,802 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2019-01-18 17:36:46,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-18 17:36:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2019-01-18 17:36:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-01-18 17:36:46,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:46,804 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2019-01-18 17:36:46,804 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:36:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2019-01-18 17:36:46,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:46,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:46,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:46,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:46,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:50,216 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-18 17:36:50,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:50,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:50,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:50,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:50,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:50,217 INFO 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-18 17:36:50,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:50,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:50,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-18 17:36:50,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:50,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:50,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-18 17:36:50,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,964 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-18 17:36:50,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:36:54,824 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-18 17:36:54,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:59,487 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-18 17:36:59,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:59,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-18 17:36:59,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:59,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-18 17:36:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-18 17:36:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13193, Invalid=20113, Unknown=0, NotChecked=0, Total=33306 [2019-01-18 17:36:59,510 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2019-01-18 17:37:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:05,455 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2019-01-18 17:37:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 17:37:05,455 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2019-01-18 17:37:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:05,457 INFO L225 Difference]: With dead ends: 401 [2019-01-18 17:37:05,457 INFO L226 Difference]: Without dead ends: 400 [2019-01-18 17:37:05,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 623 SyntacticMatches, 56 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30330 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=24464, Invalid=43396, Unknown=0, NotChecked=0, Total=67860 [2019-01-18 17:37:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-01-18 17:37:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2019-01-18 17:37:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-18 17:37:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-18 17:37:05,575 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2019-01-18 17:37:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:05,575 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-18 17:37:05,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-18 17:37:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-18 17:37:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-18 17:37:05,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:05,577 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2019-01-18 17:37:05,577 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:37:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2019-01-18 17:37:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:05,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:05,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:05,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:05,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:09,007 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-18 17:37:09,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:09,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:09,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:09,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:09,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:09,007 INFO 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-18 17:37:09,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:37:09,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:37:09,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:37:09,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:09,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:09,296 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-18 17:37:09,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,304 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-18 17:37:09,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:37:13,147 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-18 17:37:13,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:17,690 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-18 17:37:17,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:17,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-18 17:37:17,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:17,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-18 17:37:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-18 17:37:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13296, Invalid=20376, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:37:17,715 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2019-01-18 17:37:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:24,034 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-01-18 17:37:24,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:37:24,034 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2019-01-18 17:37:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:24,035 INFO L225 Difference]: With dead ends: 406 [2019-01-18 17:37:24,035 INFO L226 Difference]: Without dead ends: 405 [2019-01-18 17:37:24,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 631 SyntacticMatches, 58 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30987 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24751, Invalid=44155, Unknown=0, NotChecked=0, Total=68906 [2019-01-18 17:37:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-18 17:37:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-18 17:37:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-18 17:37:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-01-18 17:37:24,157 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2019-01-18 17:37:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:24,157 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2019-01-18 17:37:24,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-18 17:37:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2019-01-18 17:37:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-18 17:37:24,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:24,159 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2019-01-18 17:37:24,159 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:37:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2019-01-18 17:37:24,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:24,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:24,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:27,403 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-18 17:37:27,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:27,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:27,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:27,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:27,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:27,404 INFO 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-18 17:37:27,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:27,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:27,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:27,676 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-18 17:37:27,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:27,685 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-18 17:37:27,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:37:31,905 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-18 17:37:31,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:36,582 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-18 17:37:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:36,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-18 17:37:36,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:36,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-18 17:37:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-18 17:37:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13399, Invalid=20641, Unknown=0, NotChecked=0, Total=34040 [2019-01-18 17:37:36,606 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2019-01-18 17:37:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:42,738 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2019-01-18 17:37:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 17:37:42,738 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2019-01-18 17:37:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:42,739 INFO L225 Difference]: With dead ends: 411 [2019-01-18 17:37:42,740 INFO L226 Difference]: Without dead ends: 410 [2019-01-18 17:37:42,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 60 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31646 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=25039, Invalid=44921, Unknown=0, NotChecked=0, Total=69960 [2019-01-18 17:37:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-18 17:37:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-01-18 17:37:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-18 17:37:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2019-01-18 17:37:42,862 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2019-01-18 17:37:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:42,863 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2019-01-18 17:37:42,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-18 17:37:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2019-01-18 17:37:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-18 17:37:42,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:42,864 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2019-01-18 17:37:42,864 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:37:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2019-01-18 17:37:42,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:42,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:42,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:46,448 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-18 17:37:46,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:46,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:46,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:46,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:46,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:46,449 INFO 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-18 17:37:46,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:37:46,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:37:47,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-18 17:37:47,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:47,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:47,232 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-18 17:37:47,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:47,241 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-18 17:37:47,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:37:51,474 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-18 17:37:51,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:56,128 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-18 17:37:56,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:56,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-18 17:37:56,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:56,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-18 17:37:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-18 17:37:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13502, Invalid=20908, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 17:37:56,152 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2019-01-18 17:38:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:02,753 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2019-01-18 17:38:02,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:38:02,753 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2019-01-18 17:38:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:02,755 INFO L225 Difference]: With dead ends: 416 [2019-01-18 17:38:02,755 INFO L226 Difference]: Without dead ends: 415 [2019-01-18 17:38:02,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 647 SyntacticMatches, 62 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32307 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25328, Invalid=45694, Unknown=0, NotChecked=0, Total=71022 [2019-01-18 17:38:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-18 17:38:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-01-18 17:38:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-18 17:38:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2019-01-18 17:38:02,885 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2019-01-18 17:38:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:02,885 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2019-01-18 17:38:02,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-18 17:38:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2019-01-18 17:38:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-01-18 17:38:02,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:02,887 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2019-01-18 17:38:02,887 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:38:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2019-01-18 17:38:02,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:02,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:02,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:02,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:06,628 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-18 17:38:06,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:06,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:06,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:06,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:06,629 INFO 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-18 17:38:06,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:06,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:06,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:06,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:06,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:06,932 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-18 17:38:06,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:06,941 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-18 17:38:06,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:38:11,226 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-18 17:38:11,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:15,971 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-18 17:38:15,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:15,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-18 17:38:15,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:15,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-18 17:38:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-18 17:38:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13605, Invalid=21177, Unknown=0, NotChecked=0, Total=34782 [2019-01-18 17:38:15,995 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2019-01-18 17:38:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:22,444 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2019-01-18 17:38:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:38:22,445 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2019-01-18 17:38:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:22,446 INFO L225 Difference]: With dead ends: 421 [2019-01-18 17:38:22,446 INFO L226 Difference]: Without dead ends: 420 [2019-01-18 17:38:22,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 655 SyntacticMatches, 64 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32970 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=25618, Invalid=46474, Unknown=0, NotChecked=0, Total=72092 [2019-01-18 17:38:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-18 17:38:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2019-01-18 17:38:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-18 17:38:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-01-18 17:38:22,581 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2019-01-18 17:38:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:22,581 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2019-01-18 17:38:22,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-18 17:38:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2019-01-18 17:38:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-18 17:38:22,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:22,583 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2019-01-18 17:38:22,583 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:38:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2019-01-18 17:38:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:22,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:22,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:26,440 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-18 17:38:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:26,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:26,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:26,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:26,440 INFO 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-18 17:38:26,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:26,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:26,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:26,722 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-18 17:38:26,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:26,730 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-18 17:38:26,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:38:31,248 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-18 17:38:31,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:36,046 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-18 17:38:36,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:36,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-18 17:38:36,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:36,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-18 17:38:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-18 17:38:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13708, Invalid=21448, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 17:38:36,068 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2019-01-18 17:38:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:42,667 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2019-01-18 17:38:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:38:42,668 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2019-01-18 17:38:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:42,669 INFO L225 Difference]: With dead ends: 426 [2019-01-18 17:38:42,669 INFO L226 Difference]: Without dead ends: 425 [2019-01-18 17:38:42,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 663 SyntacticMatches, 66 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33635 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=25909, Invalid=47261, Unknown=0, NotChecked=0, Total=73170 [2019-01-18 17:38:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-01-18 17:38:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-01-18 17:38:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-01-18 17:38:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2019-01-18 17:38:42,805 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2019-01-18 17:38:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:42,805 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2019-01-18 17:38:42,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-18 17:38:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2019-01-18 17:38:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-18 17:38:42,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:42,807 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2019-01-18 17:38:42,808 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:38:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2019-01-18 17:38:42,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:42,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:42,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:46,901 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-18 17:38:46,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:46,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:46,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:46,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:46,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:46,902 INFO 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-18 17:38:46,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:46,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:47,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-18 17:38:47,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:47,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:47,807 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-18 17:38:47,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:47,820 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-18 17:38:47,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:38:52,423 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-18 17:38:52,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:57,127 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-18 17:38:57,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:57,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-18 17:38:57,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-18 17:38:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-18 17:38:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13811, Invalid=21721, Unknown=0, NotChecked=0, Total=35532 [2019-01-18 17:38:57,151 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 172 states. [2019-01-18 17:39:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:04,000 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2019-01-18 17:39:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-18 17:39:04,001 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 421 [2019-01-18 17:39:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:04,002 INFO L225 Difference]: With dead ends: 431 [2019-01-18 17:39:04,002 INFO L226 Difference]: Without dead ends: 430 [2019-01-18 17:39:04,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 671 SyntacticMatches, 68 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=26201, Invalid=48055, Unknown=0, NotChecked=0, Total=74256 [2019-01-18 17:39:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-18 17:39:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-01-18 17:39:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-18 17:39:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2019-01-18 17:39:04,143 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 421 [2019-01-18 17:39:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:04,144 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2019-01-18 17:39:04,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-18 17:39:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2019-01-18 17:39:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-01-18 17:39:04,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:04,146 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1, 1] [2019-01-18 17:39:04,146 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:39:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481945, now seen corresponding path program 84 times [2019-01-18 17:39:04,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:04,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:04,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:04,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:04,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:08,070 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-18 17:39:08,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:08,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:08,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:08,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:08,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:08,071 INFO 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-18 17:39:08,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:39:08,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:39:08,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:39:08,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:08,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:08,384 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-18 17:39:08,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,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-18 17:39:08,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:39:13,002 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-18 17:39:13,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:17,899 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-18 17:39:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-18 17:39:17,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:17,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-18 17:39:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-18 17:39:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13914, Invalid=21996, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:39:17,925 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 174 states. [2019-01-18 17:39:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:25,042 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2019-01-18 17:39:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 17:39:25,042 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 426 [2019-01-18 17:39:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:25,044 INFO L225 Difference]: With dead ends: 436 [2019-01-18 17:39:25,044 INFO L226 Difference]: Without dead ends: 435 [2019-01-18 17:39:25,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 679 SyntacticMatches, 70 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34971 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=26494, Invalid=48856, Unknown=0, NotChecked=0, Total=75350 [2019-01-18 17:39:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-18 17:39:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2019-01-18 17:39:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-01-18 17:39:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2019-01-18 17:39:25,189 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 426 [2019-01-18 17:39:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:25,190 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2019-01-18 17:39:25,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-18 17:39:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2019-01-18 17:39:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-01-18 17:39:25,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:25,191 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1, 1] [2019-01-18 17:39:25,192 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-18 17:39:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1766662703, now seen corresponding path program 85 times [2019-01-18 17:39:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:25,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:25,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:29,306 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-18 17:39:29,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:29,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:29,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:29,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:29,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:29,307 INFO 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-18 17:39:29,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:29,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:29,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:29,604 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-18 17:39:29,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:29,617 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-18 17:39:29,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-18 17:39:34,252 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-18 17:39:34,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:38,950 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-18 17:39:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 190 [2019-01-18 17:39:38,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:38,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-18 17:39:38,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-18 17:39:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14017, Invalid=22273, Unknown=0, NotChecked=0, Total=36290 [2019-01-18 17:39:38,973 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 176 states.