java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:24:19,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:24:19,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:24:19,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:24:19,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:24:19,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:24:19,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:24:19,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:24:19,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:24:19,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:24:19,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:24:19,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:24:19,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:24:19,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:24:19,781 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:24:19,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:24:19,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:24:19,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:24:19,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:24:19,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:24:19,798 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:24:19,800 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:24:19,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:24:19,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:24:19,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:24:19,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:24:19,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:24:19,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:24:19,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:24:19,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:24:19,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:24:19,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:24:19,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:24:19,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:24:19,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:24:19,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:24:19,818 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:24:19,838 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:24:19,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:24:19,841 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:24:19,841 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:24:19,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:24:19,844 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:24:19,844 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:24:19,845 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:24:19,845 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:24:19,845 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:24:19,845 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:24:19,845 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:24:19,846 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:24:19,846 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:24:19,846 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:24:19,848 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:24:19,848 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:24:19,848 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:24:19,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:24:19,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:24:19,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:24:19,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:24:19,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:24:19,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:24:19,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:24:19,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:24:19,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:24:19,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:24:19,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:24:19,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:24:19,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:24:19,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:24:19,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:24:19,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:24:19,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:24:19,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:24:19,854 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:24:19,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:24:19,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:24:19,855 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:24:19,855 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:24:19,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:24:19,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:24:19,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:24:19,925 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:24:19,926 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:24:19,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 16:24:19,927 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 16:24:19,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:24:19,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:24:19,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:24:19,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:24:19,973 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:24:19,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:24:20,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:24:20,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:24:20,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:24:20,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... [2018-12-03 16:24:20,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:24:20,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:24:20,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:24:20,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:24:20,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:24:20,116 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:24:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:24:20,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:24:20,367 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:24:20,369 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:24:20,369 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:24:20 BoogieIcfgContainer [2018-12-03 16:24:20,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:24:20,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:24:20,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:24:20,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:24:20,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:19" (1/2) ... [2018-12-03 16:24:20,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53282ec3 and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:24:20, skipping insertion in model container [2018-12-03 16:24:20,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:24:20" (2/2) ... [2018-12-03 16:24:20,379 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 16:24:20,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:24:20,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:24:20,419 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:24:20,462 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:24:20,462 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:24:20,462 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:24:20,462 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:24:20,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:24:20,463 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:24:20,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:24:20,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:24:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 16:24:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:24:20,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:20,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:20,495 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:20,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1807861163, now seen corresponding path program 1 times [2018-12-03 16:24:20,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:20,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:20,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:20,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:20,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:24:20,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:20,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:24:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:24:20,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:24:20,683 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 16:24:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:20,738 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-03 16:24:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:24:20,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 16:24:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:20,752 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:24:20,752 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:24:20,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:24:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:24:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:24:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:24:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 16:24:20,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-12-03 16:24:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:20,794 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 16:24:20,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:24:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 16:24:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:24:20,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:20,795 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:20,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:20,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 89245487, now seen corresponding path program 1 times [2018-12-03 16:24:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:20,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:20,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:20,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:20,976 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 16:24:20,977 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [17], [23], [25] [2018-12-03 16:24:21,072 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:24:21,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:24:21,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:24:21,320 INFO L272 AbstractInterpreter]: Visited 8 different actions 21 times. Merged at 7 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:24:21,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:21,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:24:21,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:21,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:21,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:21,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:24:21,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:24:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:24:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:24:21,521 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2018-12-03 16:24:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:21,551 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-03 16:24:21,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:24:21,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-03 16:24:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:21,553 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:24:21,553 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:24:21,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:24:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:24:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:24:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:24:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:24:21,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-03 16:24:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:21,558 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:24:21,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:24:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:24:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:24:21,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:21,560 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:21,560 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:21,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2061989811, now seen corresponding path program 2 times [2018-12-03 16:24:21,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:21,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:21,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:21,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:24:21,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:21,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:24:21,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:24:21,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:21,694 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-03 16:24:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:21,777 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-12-03 16:24:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:24:21,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-03 16:24:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:21,778 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:24:21,779 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:24:21,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:24:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:24:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:24:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-03 16:24:21,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-12-03 16:24:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:21,787 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-03 16:24:21,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:24:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-03 16:24:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:24:21,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:21,788 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:21,789 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2062049393, now seen corresponding path program 1 times [2018-12-03 16:24:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:24:21,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:21,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:24:21,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:21,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:24:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:24:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:24:21,884 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2018-12-03 16:24:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:22,074 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-03 16:24:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:24:22,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 16:24:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:22,078 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:24:22,078 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:24:22,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:24:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-12-03 16:24:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:24:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 16:24:22,093 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 11 [2018-12-03 16:24:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:22,094 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 16:24:22,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:24:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 16:24:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:24:22,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:22,095 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-03 16:24:22,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:22,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1980186676, now seen corresponding path program 1 times [2018-12-03 16:24:22,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:22,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:22,239 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 16:24:22,240 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [15], [17], [21], [23], [25] [2018-12-03 16:24:22,241 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:24:22,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:24:22,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:24:22,444 INFO L272 AbstractInterpreter]: Visited 10 different actions 49 times. Merged at 9 different actions 30 times. Widened at 4 different actions 4 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 16:24:22,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:22,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:24:22,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:22,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:22,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:22,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:22,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:22,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:24:22,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:22,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:24:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:24:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:22,644 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-12-03 16:24:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:22,676 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-03 16:24:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:24:22,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-03 16:24:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:22,678 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:24:22,678 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:24:22,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:24:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:24:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:24:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-03 16:24:22,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-12-03 16:24:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:22,685 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-03 16:24:22,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:24:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-03 16:24:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:24:22,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:22,687 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:22,687 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:22,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1317950664, now seen corresponding path program 2 times [2018-12-03 16:24:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:22,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:22,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:22,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:22,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:22,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:22,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:23,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:24:23,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:23,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:23,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:23,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:23,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:24:23,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:23,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:24:23,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:24:23,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:23,220 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-12-03 16:24:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:23,249 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-03 16:24:23,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:24:23,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-03 16:24:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:23,251 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:24:23,251 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:24:23,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:24:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:24:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:24:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-03 16:24:23,257 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-12-03 16:24:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:23,257 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-03 16:24:23,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:24:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-03 16:24:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:24:23,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:23,258 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:23,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:23,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1142069956, now seen corresponding path program 3 times [2018-12-03 16:24:23,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:23,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:23,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:23,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:23,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:23,354 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:23,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:23,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:23,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:23,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:23,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:23,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:23,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:23,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:23,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:23,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:23,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:24:23,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:23,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:24:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:24:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:23,935 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-12-03 16:24:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:23,995 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-03 16:24:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:24:23,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-03 16:24:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:23,996 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:24:23,996 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:24:23,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:24:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:24:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:24:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-03 16:24:24,002 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-12-03 16:24:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:24,002 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-03 16:24:24,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:24:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-03 16:24:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:24:24,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:24,004 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:24,004 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:24,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -375565888, now seen corresponding path program 4 times [2018-12-03 16:24:24,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:24,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:24,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:24,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:24,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:24,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:24,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:24,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:24,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:24,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:24,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:24,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:24:24,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:24,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:24:24,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:24:24,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:24,342 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-12-03 16:24:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:24,386 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-03 16:24:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:24:24,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 16:24:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:24,392 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:24:24,392 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:24:24,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:24:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:24:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:24:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-03 16:24:24,397 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-12-03 16:24:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:24,398 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-03 16:24:24,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:24:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-03 16:24:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:24:24,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:24,399 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:24,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:24,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1465268668, now seen corresponding path program 5 times [2018-12-03 16:24:24,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:24,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:24,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:24,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:24,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:24,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:24,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:24,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:24:24,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:24,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:24,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:24,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:24,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:24:24,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:24,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:24:24,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:24:24,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:24,893 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-12-03 16:24:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:24,942 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-03 16:24:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:24:24,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-03 16:24:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:24,945 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:24:24,945 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:24:24,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:24:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:24:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:24:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-03 16:24:24,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-12-03 16:24:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:24,953 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-03 16:24:24,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:24:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-03 16:24:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:24:24,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:24,954 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:24,954 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:24,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 980751032, now seen corresponding path program 6 times [2018-12-03 16:24:24,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:24,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:25,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:25,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:25,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:25,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:25,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:25,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:25,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:25,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:25,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:25,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:25,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:25,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:24:25,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:25,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:25,489 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-12-03 16:24:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:25,532 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-03 16:24:25,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:24:25,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-03 16:24:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:25,535 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:24:25,535 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:24:25,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:24:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:24:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:24:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-03 16:24:25,542 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-12-03 16:24:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:25,542 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-03 16:24:25,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-03 16:24:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:24:25,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:25,544 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:25,544 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:25,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash -784229196, now seen corresponding path program 7 times [2018-12-03 16:24:25,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:25,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:25,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:25,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:25,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:25,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:25,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:25,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:25,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:26,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:24:26,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:26,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:24:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:24:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:26,010 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-12-03 16:24:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:26,059 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-03 16:24:26,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:24:26,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-03 16:24:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:26,064 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:24:26,064 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:24:26,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:24:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:24:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:24:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-03 16:24:26,071 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-12-03 16:24:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:26,071 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-03 16:24:26,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:24:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-03 16:24:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:24:26,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:26,072 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:26,073 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:26,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -418146384, now seen corresponding path program 8 times [2018-12-03 16:24:26,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:26,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:26,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:26,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:26,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:26,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:26,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:26,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:26,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:26,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:26,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:26,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:24:26,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:26,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:26,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:26,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:26,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:24:26,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:26,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:24:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:24:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:26,695 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-12-03 16:24:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:26,773 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-03 16:24:26,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:24:26,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-03 16:24:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:26,775 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:24:26,775 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:24:26,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:24:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:24:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:24:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-03 16:24:26,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-12-03 16:24:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:26,786 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-03 16:24:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:24:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-03 16:24:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:24:26,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:26,787 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:26,787 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:26,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:26,788 INFO L82 PathProgramCache]: Analyzing trace with hash -799882324, now seen corresponding path program 9 times [2018-12-03 16:24:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:27,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:27,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:27,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:27,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:27,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:27,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:27,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:27,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:27,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:27,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:27,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:27,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:27,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:27,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:24:27,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:27,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:24:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:24:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:24:27,992 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 13 states. [2018-12-03 16:24:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:28,029 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 16:24:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:24:28,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-12-03 16:24:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:28,031 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:24:28,031 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:24:28,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:24:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:24:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:24:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:24:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-03 16:24:28,038 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-12-03 16:24:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:28,038 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-03 16:24:28,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:24:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-03 16:24:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:24:28,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:28,039 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:28,040 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:28,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1719066792, now seen corresponding path program 10 times [2018-12-03 16:24:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:28,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:28,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:28,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:28,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:28,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:28,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:28,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:28,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:28,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:24:28,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:28,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:24:28,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:24:28,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:24:28,821 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 14 states. [2018-12-03 16:24:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:28,866 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-12-03 16:24:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:24:28,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-12-03 16:24:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:28,867 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:24:28,867 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:24:28,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:24:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:24:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:24:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:24:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-03 16:24:28,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-12-03 16:24:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:28,876 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-03 16:24:28,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:24:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-03 16:24:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:24:28,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:28,877 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:28,877 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:28,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash 67612324, now seen corresponding path program 11 times [2018-12-03 16:24:28,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:29,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:29,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:29,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:29,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:29,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:29,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:29,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:24:29,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:29,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:29,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:29,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:29,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:24:29,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:29,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:24:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:24:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:24:29,563 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2018-12-03 16:24:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:29,634 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-12-03 16:24:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:24:29,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-12-03 16:24:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:29,638 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:24:29,638 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:24:29,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:24:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:24:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:24:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:24:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-03 16:24:29,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 40 [2018-12-03 16:24:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:29,645 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-03 16:24:29,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:24:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-03 16:24:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:24:29,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:29,646 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:29,646 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:29,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2137199200, now seen corresponding path program 12 times [2018-12-03 16:24:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:29,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:29,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:29,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:29,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:29,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:29,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:29,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:29,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:29,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:29,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:30,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:30,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:24:30,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:30,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:24:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:24:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:24:30,190 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 16 states. [2018-12-03 16:24:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:30,217 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-03 16:24:30,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:24:30,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-12-03 16:24:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:30,218 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:24:30,218 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:24:30,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:24:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:24:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:24:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:24:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 16:24:30,225 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-12-03 16:24:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:30,225 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 16:24:30,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:24:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 16:24:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:24:30,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:30,226 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:30,227 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:30,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 752770460, now seen corresponding path program 13 times [2018-12-03 16:24:30,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:30,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:30,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:31,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:31,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:31,050 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:31,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:31,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:31,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:31,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:31,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:31,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:31,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:31,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:24:31,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:24:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:24:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:24:31,482 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 17 states. [2018-12-03 16:24:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:31,511 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-03 16:24:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:24:31,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-03 16:24:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:31,512 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:24:31,513 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:24:31,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:24:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:24:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:24:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:24:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-03 16:24:31,521 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2018-12-03 16:24:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:31,521 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-03 16:24:31,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:24:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-03 16:24:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:24:31,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:31,522 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:31,523 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:31,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash -830226792, now seen corresponding path program 14 times [2018-12-03 16:24:31,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:31,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:31,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:31,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:31,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:31,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:31,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:31,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:31,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:31,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:31,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:31,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:31,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:24:31,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:31,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:31,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:32,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:32,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:24:32,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:32,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:24:32,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:24:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:24:32,261 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 18 states. [2018-12-03 16:24:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:32,326 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-12-03 16:24:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:24:32,327 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-03 16:24:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:32,327 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:24:32,327 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:24:32,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:24:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:24:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:24:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:24:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-03 16:24:32,334 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 46 [2018-12-03 16:24:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:32,334 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-03 16:24:32,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:24:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-03 16:24:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:24:32,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:32,336 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:32,336 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:32,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1672163180, now seen corresponding path program 15 times [2018-12-03 16:24:32,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:32,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:32,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:32,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:33,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:33,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:33,162 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:33,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:33,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:33,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:33,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:33,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:33,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:33,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:33,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:33,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:34,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:34,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:24:34,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:34,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:24:34,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:24:34,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:24:34,140 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2018-12-03 16:24:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:34,191 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-03 16:24:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:24:34,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-03 16:24:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:34,192 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:24:34,192 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:24:34,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:24:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:24:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:24:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:24:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-12-03 16:24:34,198 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 48 [2018-12-03 16:24:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:34,198 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-12-03 16:24:34,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:24:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-12-03 16:24:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:24:34,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:34,199 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:34,200 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:34,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash 975786896, now seen corresponding path program 16 times [2018-12-03 16:24:34,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:34,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:34,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:34,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:34,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:34,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:34,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:34,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:34,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:34,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:34,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:34,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:34,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:34,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:35,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:35,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:24:35,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:35,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:24:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:24:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:24:35,585 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 20 states. [2018-12-03 16:24:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:35,637 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-03 16:24:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:24:35,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-12-03 16:24:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:35,639 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:24:35,639 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:24:35,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:24:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:24:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:24:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:24:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-03 16:24:35,646 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 50 [2018-12-03 16:24:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:35,646 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-03 16:24:35,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:24:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-03 16:24:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:24:35,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:35,648 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:35,648 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:35,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1259796596, now seen corresponding path program 17 times [2018-12-03 16:24:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:35,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:36,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:36,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:36,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:36,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:36,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:36,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:36,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:36,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:36,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:24:36,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:36,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:36,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:37,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:37,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:24:37,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:37,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:24:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:24:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:24:37,085 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2018-12-03 16:24:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:37,116 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-03 16:24:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:24:37,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-03 16:24:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:37,117 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:24:37,117 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:24:37,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:24:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:24:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:24:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:24:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-03 16:24:37,124 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 52 [2018-12-03 16:24:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:37,124 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-03 16:24:37,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:24:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-03 16:24:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:24:37,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:37,125 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:37,125 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:37,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2123082888, now seen corresponding path program 18 times [2018-12-03 16:24:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:37,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:37,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:37,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:37,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:37,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:37,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:37,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:37,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:37,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:37,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:37,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:37,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:38,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:24:38,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:38,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:24:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:24:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:24:38,299 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2018-12-03 16:24:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:38,453 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 16:24:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:24:38,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-12-03 16:24:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:38,456 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:24:38,456 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:24:38,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:24:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:24:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:24:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:24:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-03 16:24:38,461 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 54 [2018-12-03 16:24:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:38,462 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-03 16:24:38,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:24:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-03 16:24:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:24:38,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:38,463 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:38,463 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:38,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1780023940, now seen corresponding path program 19 times [2018-12-03 16:24:38,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:38,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:38,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:38,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:38,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:38,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:38,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:38,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:38,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:38,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:38,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:38,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:38,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:38,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:38,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:24:39,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:39,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:24:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:24:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:24:39,428 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 23 states. [2018-12-03 16:24:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:39,512 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-03 16:24:39,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:24:39,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-12-03 16:24:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:39,513 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:24:39,513 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:24:39,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:24:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:24:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:24:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:24:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-03 16:24:39,519 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 56 [2018-12-03 16:24:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:39,519 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-03 16:24:39,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:24:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-03 16:24:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:24:39,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:39,520 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:39,521 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:39,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:39,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1482110592, now seen corresponding path program 20 times [2018-12-03 16:24:39,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:39,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:39,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:39,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:39,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:39,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:39,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:39,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:39,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:39,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:39,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:24:39,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:39,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:39,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:40,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:40,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:24:40,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:40,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:24:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:24:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:24:40,731 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 24 states. [2018-12-03 16:24:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:40,815 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-03 16:24:40,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:24:40,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-12-03 16:24:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:40,816 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:24:40,816 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:24:40,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:24:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:24:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:24:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:24:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-03 16:24:40,821 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 58 [2018-12-03 16:24:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:40,821 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-03 16:24:40,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:24:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-03 16:24:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:24:40,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:40,822 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:40,822 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:40,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1067269764, now seen corresponding path program 21 times [2018-12-03 16:24:40,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:40,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:40,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:41,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:41,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:41,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:41,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:41,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:41,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:41,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:41,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:41,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:41,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:41,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:41,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:41,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:24:41,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:41,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:24:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:24:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:24:41,933 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 25 states. [2018-12-03 16:24:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:42,104 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-03 16:24:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:24:42,107 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 16:24:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:42,108 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:24:42,108 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:24:42,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:24:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:24:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:24:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:24:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-03 16:24:42,113 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2018-12-03 16:24:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:42,113 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-03 16:24:42,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:24:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-03 16:24:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:24:42,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:42,114 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:42,114 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:42,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1837192584, now seen corresponding path program 22 times [2018-12-03 16:24:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:42,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:42,540 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:42,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:42,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:42,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:42,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:42,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:42,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:43,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:43,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:24:43,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:24:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:24:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:24:43,530 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 26 states. [2018-12-03 16:24:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:43,565 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-03 16:24:43,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:24:43,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-12-03 16:24:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:43,566 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:24:43,566 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:24:43,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:24:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:24:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:24:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:24:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 16:24:43,573 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2018-12-03 16:24:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:43,573 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 16:24:43,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:24:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 16:24:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:24:43,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:43,573 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:43,574 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:43,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1296319604, now seen corresponding path program 23 times [2018-12-03 16:24:43,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:43,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:43,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:44,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:44,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:44,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:44,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:44,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:44,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:44,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:44,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:44,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:24:44,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:44,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:44,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:45,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:45,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:24:45,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:45,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:24:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:24:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:24:45,350 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 27 states. [2018-12-03 16:24:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:45,422 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-03 16:24:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:24:45,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-12-03 16:24:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:45,424 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:24:45,424 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:24:45,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:24:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:24:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:24:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:24:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-03 16:24:45,428 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2018-12-03 16:24:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:45,428 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-03 16:24:45,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:24:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-03 16:24:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:24:45,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:45,429 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:45,429 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:45,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1829457776, now seen corresponding path program 24 times [2018-12-03 16:24:45,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:45,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:45,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:45,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:45,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:45,852 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:45,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:45,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:45,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:45,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:45,862 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:45,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:45,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:45,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:45,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:24:47,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:47,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:24:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:24:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:24:47,137 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 28 states. [2018-12-03 16:24:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:47,190 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-03 16:24:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:24:47,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-12-03 16:24:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:47,191 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:24:47,191 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:24:47,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:24:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:24:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:24:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:24:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 16:24:47,195 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2018-12-03 16:24:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:47,195 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 16:24:47,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:24:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 16:24:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:24:47,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:47,196 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:47,196 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:47,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1220834452, now seen corresponding path program 25 times [2018-12-03 16:24:47,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:47,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:47,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:47,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:47,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:47,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:47,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:47,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:47,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:47,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:47,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:47,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:49,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:49,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:24:49,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:49,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:24:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:24:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:24:49,072 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 29 states. [2018-12-03 16:24:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:49,166 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-03 16:24:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:24:49,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-12-03 16:24:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:49,167 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:24:49,167 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:24:49,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:24:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:24:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:24:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:24:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-12-03 16:24:49,175 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2018-12-03 16:24:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:49,175 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-12-03 16:24:49,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:24:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-12-03 16:24:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:24:49,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:49,176 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:49,176 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:49,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 910997608, now seen corresponding path program 26 times [2018-12-03 16:24:49,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:49,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:49,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:49,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:49,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:49,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:49,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:49,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:24:49,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:49,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:49,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:50,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:50,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:24:50,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:50,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:24:50,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:24:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:24:50,706 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 30 states. [2018-12-03 16:24:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:50,776 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-03 16:24:50,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:24:50,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-12-03 16:24:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:50,777 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:24:50,777 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:24:50,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:24:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:24:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:24:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:24:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-03 16:24:50,782 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 70 [2018-12-03 16:24:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:50,783 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-03 16:24:50,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:24:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-03 16:24:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:24:50,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:50,783 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:50,783 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:50,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash 902207076, now seen corresponding path program 27 times [2018-12-03 16:24:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:50,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:50,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:51,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:51,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:51,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:51,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:51,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:51,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:51,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:51,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:51,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:51,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:51,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:51,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:52,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:52,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:24:52,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:52,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:24:52,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:24:52,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:24:52,486 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 31 states. [2018-12-03 16:24:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:52,554 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-03 16:24:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:24:52,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-12-03 16:24:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:52,556 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:24:52,556 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:24:52,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:24:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:24:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:24:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:24:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-12-03 16:24:52,562 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 72 [2018-12-03 16:24:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:52,562 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-12-03 16:24:52,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:24:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-12-03 16:24:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:24:52,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:52,563 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:52,563 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:52,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:52,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1044440416, now seen corresponding path program 28 times [2018-12-03 16:24:52,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:52,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:52,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:52,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:52,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:53,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:53,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:53,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:53,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:53,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:53,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:53,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:53,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:54,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:54,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:24:54,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:54,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:24:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:24:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:24:54,349 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 32 states. [2018-12-03 16:24:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:54,422 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-03 16:24:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:24:54,423 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-12-03 16:24:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:54,423 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:24:54,423 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:24:54,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:24:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:24:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:24:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:24:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-12-03 16:24:54,429 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 74 [2018-12-03 16:24:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:54,430 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-12-03 16:24:54,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:24:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-12-03 16:24:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:24:54,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:54,430 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:54,431 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:54,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:54,431 INFO L82 PathProgramCache]: Analyzing trace with hash 291726684, now seen corresponding path program 29 times [2018-12-03 16:24:54,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:54,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:54,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:55,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:55,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:55,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:55,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:55,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:55,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:55,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:55,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:55,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:24:55,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:55,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:55,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:56,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:56,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:24:56,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:56,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:24:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:24:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:24:56,245 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 33 states. [2018-12-03 16:24:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:56,333 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-12-03 16:24:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:24:56,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-12-03 16:24:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:56,334 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:24:56,334 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:24:56,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:24:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:24:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:24:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:24:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-12-03 16:24:56,339 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 76 [2018-12-03 16:24:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:56,339 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-12-03 16:24:56,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:24:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-12-03 16:24:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:24:56,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:56,340 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:56,340 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:56,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1511664040, now seen corresponding path program 30 times [2018-12-03 16:24:56,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:56,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:56,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:56,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:56,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:56,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:56,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:56,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:56,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:56,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:56,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:56,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:56,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:56,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:56,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:58,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:58,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:24:58,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:58,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:24:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:24:58,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:24:58,076 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 34 states. [2018-12-03 16:24:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:58,132 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-03 16:24:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:24:58,132 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-12-03 16:24:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:58,133 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:24:58,133 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:24:58,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:24:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:24:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:24:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:24:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-03 16:24:58,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 78 [2018-12-03 16:24:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:58,138 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-03 16:24:58,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:24:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-03 16:24:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:24:58,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:58,138 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:58,139 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:58,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:58,139 INFO L82 PathProgramCache]: Analyzing trace with hash 596637780, now seen corresponding path program 31 times [2018-12-03 16:24:58,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:58,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:58,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:58,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:58,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:58,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:58,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:58,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:58,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:58,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:24:58,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:00,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:00,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:25:00,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:00,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:25:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:25:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:25:00,326 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 35 states. [2018-12-03 16:25:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:00,446 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-12-03 16:25:00,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:25:00,453 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-12-03 16:25:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:00,454 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:25:00,454 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:25:00,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:25:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:25:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:25:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:25:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-12-03 16:25:00,460 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 80 [2018-12-03 16:25:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:00,460 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-12-03 16:25:00,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:25:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-12-03 16:25:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:25:00,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:00,461 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:00,461 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:00,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash -549876912, now seen corresponding path program 32 times [2018-12-03 16:25:00,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:00,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:00,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:00,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:00,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:01,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:01,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:01,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:01,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:01,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:01,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:01,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:01,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:01,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:25:01,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:01,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:01,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:02,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:02,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:25:02,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:25:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:25:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:25:02,664 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2018-12-03 16:25:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:02,885 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-03 16:25:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:25:02,888 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 82 [2018-12-03 16:25:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:02,889 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:25:02,889 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:25:02,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:25:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:25:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:25:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:25:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-12-03 16:25:02,894 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 82 [2018-12-03 16:25:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:02,894 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-12-03 16:25:02,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:25:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-12-03 16:25:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:25:02,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:02,895 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:02,895 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:02,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1456099148, now seen corresponding path program 33 times [2018-12-03 16:25:02,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:02,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:02,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:02,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:04,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:04,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:04,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:04,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:04,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:04,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:04,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:04,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:04,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:04,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:04,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:04,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:05,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:05,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:25:05,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:05,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:25:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:25:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:25:05,521 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 37 states. [2018-12-03 16:25:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:05,585 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-03 16:25:05,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:25:05,586 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 84 [2018-12-03 16:25:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:05,586 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:25:05,587 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:25:05,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:25:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:25:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:25:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:25:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-03 16:25:05,591 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 84 [2018-12-03 16:25:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:05,592 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-03 16:25:05,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:25:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-03 16:25:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:25:05,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:05,593 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:05,593 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:05,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 758776904, now seen corresponding path program 34 times [2018-12-03 16:25:05,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:05,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:05,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:06,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:06,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:06,560 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:06,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:06,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:06,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:06,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:06,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:06,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:06,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:08,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:08,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:25:08,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:08,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:25:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:25:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:25:08,024 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 38 states. [2018-12-03 16:25:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:08,121 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-03 16:25:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:25:08,122 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-12-03 16:25:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:08,122 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:25:08,122 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:25:08,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:25:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:25:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:25:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:25:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-12-03 16:25:08,127 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 86 [2018-12-03 16:25:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:08,127 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-12-03 16:25:08,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:25:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-12-03 16:25:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:25:08,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:08,128 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:08,128 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:08,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 646998596, now seen corresponding path program 35 times [2018-12-03 16:25:08,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:08,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:08,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:09,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:09,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:09,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:09,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:09,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:09,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:09,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:09,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:25:09,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:10,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:10,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:11,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:11,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:25:11,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:11,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:25:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:25:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:25:11,664 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 39 states. [2018-12-03 16:25:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:11,720 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-03 16:25:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:25:11,720 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2018-12-03 16:25:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:11,721 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:25:11,721 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:25:11,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:25:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:25:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:25:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:25:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-12-03 16:25:11,727 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 88 [2018-12-03 16:25:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:11,728 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-12-03 16:25:11,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:25:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-12-03 16:25:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:25:11,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:11,728 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:11,729 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:11,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 602227008, now seen corresponding path program 36 times [2018-12-03 16:25:11,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:11,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:11,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:12,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:12,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:12,360 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:12,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:12,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:12,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:12,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:12,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:12,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:12,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:12,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:12,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:14,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:14,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:25:14,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:14,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:25:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:25:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:25:14,435 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 40 states. [2018-12-03 16:25:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:14,518 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-03 16:25:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:25:14,519 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-12-03 16:25:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:14,520 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:25:14,520 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:25:14,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:25:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:25:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:25:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:25:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-12-03 16:25:14,525 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2018-12-03 16:25:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:14,525 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-12-03 16:25:14,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:25:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-12-03 16:25:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:25:14,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:14,526 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:14,526 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:14,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 526403900, now seen corresponding path program 37 times [2018-12-03 16:25:14,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:14,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:14,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:14,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:14,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:15,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:15,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:15,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:15,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:15,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:15,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:15,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:15,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:15,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:15,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:17,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:17,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:25:17,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:17,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:25:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:25:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:25:17,020 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 41 states. [2018-12-03 16:25:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:17,129 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-12-03 16:25:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:25:17,130 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 92 [2018-12-03 16:25:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:17,130 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:25:17,131 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:25:17,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:25:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:25:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:25:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:25:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-12-03 16:25:17,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2018-12-03 16:25:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:17,137 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-12-03 16:25:17,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:25:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-12-03 16:25:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:25:17,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:17,138 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:17,138 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:17,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:17,138 INFO L82 PathProgramCache]: Analyzing trace with hash 674841144, now seen corresponding path program 38 times [2018-12-03 16:25:17,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:17,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:17,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:17,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:17,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:18,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:18,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:18,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:18,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:18,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:18,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:18,268 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:18,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:25:18,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:18,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:18,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:20,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:20,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:25:20,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:20,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:25:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:25:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:25:20,472 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 42 states. [2018-12-03 16:25:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:20,700 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-03 16:25:20,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:25:20,700 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 94 [2018-12-03 16:25:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:20,701 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:25:20,701 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:25:20,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:25:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:25:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:25:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:25:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-03 16:25:20,708 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2018-12-03 16:25:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:20,708 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-03 16:25:20,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:25:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-03 16:25:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:25:20,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:20,709 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:20,709 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:20,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:20,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1589111860, now seen corresponding path program 39 times [2018-12-03 16:25:20,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:20,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:20,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:20,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:20,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:21,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:21,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:21,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:21,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:21,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:21,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:21,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:21,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:21,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:21,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:21,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:23,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:23,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:25:23,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:23,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:25:23,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:25:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:25:23,475 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 43 states. [2018-12-03 16:25:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:23,605 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-03 16:25:23,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:25:23,605 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2018-12-03 16:25:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:23,606 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:25:23,606 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:25:23,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:25:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:25:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:25:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:25:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-12-03 16:25:23,614 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2018-12-03 16:25:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:23,615 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-12-03 16:25:23,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:25:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-12-03 16:25:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:25:23,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:23,616 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:23,616 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:23,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -265025744, now seen corresponding path program 40 times [2018-12-03 16:25:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:23,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:23,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:23,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:25,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:25,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:25,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:25,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:25,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:25,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:25,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:25,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:25:28,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:28,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:25:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:25:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:25:28,135 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 44 states. [2018-12-03 16:25:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:29,188 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-12-03 16:25:29,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:25:29,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 98 [2018-12-03 16:25:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:29,189 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:25:29,189 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:25:29,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:25:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:25:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:25:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:25:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 16:25:29,195 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2018-12-03 16:25:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:29,195 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 16:25:29,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:25:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 16:25:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:25:29,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:29,196 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:29,196 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 320164652, now seen corresponding path program 41 times [2018-12-03 16:25:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:30,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:30,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:30,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:30,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:30,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:30,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:30,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:25:30,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:30,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:30,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:32,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:32,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:25:32,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:32,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:25:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:25:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:25:32,629 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 45 states. [2018-12-03 16:25:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:32,732 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-12-03 16:25:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:25:32,733 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 100 [2018-12-03 16:25:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:32,734 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:25:32,734 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:25:32,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:25:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:25:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:25:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:25:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-12-03 16:25:32,741 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 100 [2018-12-03 16:25:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:32,741 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-12-03 16:25:32,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:25:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-12-03 16:25:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:25:32,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:32,742 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:32,743 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:32,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash 47419432, now seen corresponding path program 42 times [2018-12-03 16:25:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:33,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:33,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:33,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:33,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:33,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:33,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:33,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:33,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:33,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:33,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:33,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1910 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:36,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:36,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:25:36,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:36,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:25:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:25:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:25:36,238 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 46 states. [2018-12-03 16:25:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:36,324 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-03 16:25:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:25:36,324 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 102 [2018-12-03 16:25:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:36,326 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:25:36,326 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:25:36,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:25:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:25:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:25:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:25:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 16:25:36,333 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 102 [2018-12-03 16:25:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:36,333 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 16:25:36,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:25:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 16:25:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:25:36,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:36,334 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:36,334 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:36,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash -67731932, now seen corresponding path program 43 times [2018-12-03 16:25:36,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:36,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:36,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:37,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:37,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:37,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:37,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:37,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:37,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:37,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:37,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:37,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:37,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:25:39,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:39,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:25:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:25:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:25:39,855 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2018-12-03 16:25:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:40,046 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-12-03 16:25:40,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:25:40,047 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2018-12-03 16:25:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:40,048 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:25:40,048 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:25:40,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:25:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:25:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:25:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:25:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-03 16:25:40,056 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 104 [2018-12-03 16:25:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:40,056 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-03 16:25:40,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:25:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-03 16:25:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:25:40,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:40,057 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:40,058 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:40,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:40,058 INFO L82 PathProgramCache]: Analyzing trace with hash 940956960, now seen corresponding path program 44 times [2018-12-03 16:25:40,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:40,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:41,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:41,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:41,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:41,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:41,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:41,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:41,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:41,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:41,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:25:41,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:41,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:41,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:43,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:25:43,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:43,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:25:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:25:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:25:43,924 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 48 states. [2018-12-03 16:25:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:44,130 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-12-03 16:25:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:25:44,131 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-12-03 16:25:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:44,132 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:25:44,132 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:25:44,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:25:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:25:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:25:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:25:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-12-03 16:25:44,139 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 106 [2018-12-03 16:25:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:44,139 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-12-03 16:25:44,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:25:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-12-03 16:25:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:25:44,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:44,140 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:44,140 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:44,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash -371626724, now seen corresponding path program 45 times [2018-12-03 16:25:44,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:44,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:44,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:45,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:45,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:45,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:45,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:45,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:45,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:45,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:45,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:45,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:45,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:45,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:45,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:48,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:25:48,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:48,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:25:48,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:25:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:25:48,098 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 49 states. [2018-12-03 16:25:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,232 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-03 16:25:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:25:48,233 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 108 [2018-12-03 16:25:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,234 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:25:48,234 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:25:48,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:25:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:25:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:25:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:25:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-12-03 16:25:48,241 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 108 [2018-12-03 16:25:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,241 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-12-03 16:25:48,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:25:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-12-03 16:25:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:25:48,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,242 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:48,242 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash 955837976, now seen corresponding path program 46 times [2018-12-03 16:25:48,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:49,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:49,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:49,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:49,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:49,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:49,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:49,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:52,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:25:52,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:52,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:25:52,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:25:52,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:25:52,157 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 50 states. [2018-12-03 16:25:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:52,258 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-03 16:25:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:25:52,259 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 110 [2018-12-03 16:25:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:52,260 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:25:52,261 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:25:52,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:25:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:25:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:25:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:25:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-12-03 16:25:52,266 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 110 [2018-12-03 16:25:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:52,267 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-12-03 16:25:52,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:25:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-12-03 16:25:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:25:52,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:52,268 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:52,268 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:52,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1044127764, now seen corresponding path program 47 times [2018-12-03 16:25:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:52,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:52,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:53,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:53,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:53,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:53,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:53,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:53,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:53,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:53,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:53,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:25:53,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:53,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:53,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2370 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:56,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:56,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:25:56,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:56,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:25:56,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:25:56,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:25:56,507 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 51 states. [2018-12-03 16:25:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:56,619 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-12-03 16:25:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:25:56,623 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 112 [2018-12-03 16:25:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:56,624 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:25:56,624 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:25:56,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:25:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:25:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:25:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:25:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-03 16:25:56,631 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 112 [2018-12-03 16:25:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:56,632 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-03 16:25:56,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:25:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-03 16:25:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:25:56,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:56,634 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:25:56,634 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:56,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash -8731888, now seen corresponding path program 48 times [2018-12-03 16:25:56,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:56,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:56,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:56,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:56,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:57,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:57,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:57,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:57,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:57,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:57,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:25:57,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:57,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:57,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:57,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:57,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:25:57,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2468 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:00,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:26:00,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:26:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:26:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:26:00,624 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 52 states. [2018-12-03 16:26:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:00,749 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-03 16:26:00,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:26:00,750 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 114 [2018-12-03 16:26:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:00,751 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:26:00,751 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:26:00,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:26:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:26:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 16:26:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:26:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-12-03 16:26:00,757 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 114 [2018-12-03 16:26:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:00,758 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-12-03 16:26:00,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:26:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-12-03 16:26:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:26:00,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:00,758 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:00,759 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:00,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1805424396, now seen corresponding path program 49 times [2018-12-03 16:26:00,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:01,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:01,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:01,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:01,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:01,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:01,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:02,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:05,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:26:05,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:05,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:26:05,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:26:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:26:05,894 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 53 states. [2018-12-03 16:26:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:05,962 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-12-03 16:26:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:26:05,962 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 116 [2018-12-03 16:26:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:05,963 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:26:05,963 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 16:26:05,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:26:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 16:26:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 16:26:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 16:26:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-03 16:26:05,969 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 116 [2018-12-03 16:26:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:05,970 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-03 16:26:05,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:26:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-03 16:26:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:26:05,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:05,971 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:05,971 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:05,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1452891144, now seen corresponding path program 50 times [2018-12-03 16:26:05,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:07,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:07,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:07,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:07,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:07,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:26:07,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:07,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:07,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:26:10,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:10,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:26:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:26:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:26:10,733 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 54 states. [2018-12-03 16:26:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:10,818 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-03 16:26:10,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:26:10,818 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 118 [2018-12-03 16:26:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:10,820 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:26:10,820 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:26:10,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:26:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:26:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 16:26:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:26:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-12-03 16:26:10,825 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 118 [2018-12-03 16:26:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:10,825 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-12-03 16:26:10,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:26:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-12-03 16:26:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:26:10,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:10,826 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:10,826 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:10,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1970852356, now seen corresponding path program 51 times [2018-12-03 16:26:10,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:10,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:10,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:11,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:11,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:11,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:11,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:11,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:11,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:12,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:12,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:12,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:12,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:26:15,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:15,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:26:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:26:15,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:26:15,731 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 55 states. [2018-12-03 16:26:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:15,896 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-03 16:26:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:26:15,897 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 120 [2018-12-03 16:26:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:15,898 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:26:15,898 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:26:15,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:26:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:26:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 16:26:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:26:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-12-03 16:26:15,905 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 120 [2018-12-03 16:26:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:15,905 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-12-03 16:26:15,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:26:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-12-03 16:26:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:26:15,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:15,906 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:15,906 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:15,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:15,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1515370752, now seen corresponding path program 52 times [2018-12-03 16:26:15,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:15,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:15,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:15,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:15,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:17,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:17,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:17,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:17,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:17,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:17,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:17,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:20,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:20,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:26:20,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:20,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:26:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:26:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:26:20,611 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 56 states. [2018-12-03 16:26:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:20,764 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-03 16:26:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:26:20,764 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 122 [2018-12-03 16:26:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:20,765 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:26:20,765 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:26:20,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:26:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:26:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 16:26:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 16:26:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-12-03 16:26:20,771 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 122 [2018-12-03 16:26:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-12-03 16:26:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:26:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-12-03 16:26:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 16:26:20,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:20,772 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:20,772 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:20,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1884213500, now seen corresponding path program 53 times [2018-12-03 16:26:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:20,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:20,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:20,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:21,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:21,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:21,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:21,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:21,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:21,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:22,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:26:22,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:22,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:22,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:25,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:26:25,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:25,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:26:25,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:26:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:26:25,272 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 57 states. [2018-12-03 16:26:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:25,532 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-12-03 16:26:25,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:26:25,532 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 124 [2018-12-03 16:26:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:25,533 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:26:25,533 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:26:25,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:26:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:26:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 16:26:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 16:26:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-12-03 16:26:25,540 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 124 [2018-12-03 16:26:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:25,541 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-12-03 16:26:25,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:26:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-12-03 16:26:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:26:25,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:25,542 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:25,542 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:25,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash -140191240, now seen corresponding path program 54 times [2018-12-03 16:26:25,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:25,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:25,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:26,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:26,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:26,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:26,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:26,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:26,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:26,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:26,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:26,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:26,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:26,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3098 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:30,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:30,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:26:30,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:30,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:26:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:26:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:26:30,259 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 58 states. [2018-12-03 16:26:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:30,378 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-03 16:26:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:26:30,378 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 126 [2018-12-03 16:26:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:30,379 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:26:30,379 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 16:26:30,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:26:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 16:26:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 16:26:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 16:26:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-03 16:26:30,385 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 126 [2018-12-03 16:26:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:30,385 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-03 16:26:30,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:26:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-03 16:26:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:26:30,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:30,386 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:30,386 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:30,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:30,387 INFO L82 PathProgramCache]: Analyzing trace with hash 27038708, now seen corresponding path program 55 times [2018-12-03 16:26:30,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:30,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:30,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:31,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:31,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:31,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:31,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:31,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:31,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:31,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:31,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:31,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:31,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3210 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:35,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:35,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:26:35,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:35,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:26:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:26:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:26:35,319 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2018-12-03 16:26:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:35,430 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-12-03 16:26:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:26:35,430 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2018-12-03 16:26:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:35,431 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:26:35,431 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:26:35,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:26:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:26:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 16:26:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:26:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-12-03 16:26:35,438 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 128 [2018-12-03 16:26:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:35,439 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-12-03 16:26:35,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:26:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-12-03 16:26:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:26:35,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:35,440 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:35,440 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:35,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1821228784, now seen corresponding path program 56 times [2018-12-03 16:26:35,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:35,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:37,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:37,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:37,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:37,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:37,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:37,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:37,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:37,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:37,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 16:26:37,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:37,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:37,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3324 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:41,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:26:41,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:41,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:26:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:26:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:26:41,206 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 60 states. [2018-12-03 16:26:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:41,363 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-12-03 16:26:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:26:41,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 130 [2018-12-03 16:26:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:41,364 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:26:41,364 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:26:41,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:26:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:26:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 16:26:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 16:26:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-03 16:26:41,370 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 130 [2018-12-03 16:26:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:41,370 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-03 16:26:41,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:26:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-03 16:26:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:26:41,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:41,371 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:41,372 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:41,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -538961172, now seen corresponding path program 57 times [2018-12-03 16:26:41,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:42,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:42,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:42,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:42,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:42,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:42,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:42,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:42,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:42,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:42,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:42,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:42,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:46,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:46,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:26:46,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:46,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:26:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:26:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:26:46,809 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 61 states. [2018-12-03 16:26:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:46,966 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-03 16:26:46,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:26:46,966 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 132 [2018-12-03 16:26:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:46,967 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:26:46,967 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:26:46,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:26:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:26:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 16:26:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:26:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-12-03 16:26:46,973 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 132 [2018-12-03 16:26:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:46,973 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-12-03 16:26:46,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:26:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-12-03 16:26:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:26:46,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:46,974 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:46,974 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:46,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash -938776600, now seen corresponding path program 58 times [2018-12-03 16:26:46,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:46,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:46,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:46,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:46,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:48,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:48,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:48,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:48,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:48,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:48,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:48,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:48,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:48,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3558 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:52,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:52,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:26:52,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:52,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:26:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:26:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:26:52,704 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 62 states. [2018-12-03 16:26:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:52,803 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-12-03 16:26:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:26:52,804 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 134 [2018-12-03 16:26:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:52,805 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:26:52,805 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 16:26:52,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:26:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 16:26:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 16:26:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 16:26:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-12-03 16:26:52,813 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 134 [2018-12-03 16:26:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:52,813 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-12-03 16:26:52,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:26:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-12-03 16:26:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 16:26:52,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:52,814 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:52,814 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:52,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1385653732, now seen corresponding path program 59 times [2018-12-03 16:26:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:52,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:52,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:52,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:52,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:54,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:54,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:54,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:54,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:54,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:54,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:54,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:54,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:54,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 16:26:54,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:54,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:54,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3678 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:26:58,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:58,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:26:58,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:58,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:26:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:26:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:26:58,638 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 63 states. [2018-12-03 16:26:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:58,813 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-12-03 16:26:58,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:26:58,814 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 136 [2018-12-03 16:26:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:58,815 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:26:58,815 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:26:58,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:26:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:26:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 16:26:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 16:26:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-12-03 16:26:58,820 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 136 [2018-12-03 16:26:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:58,821 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-12-03 16:26:58,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:26:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-12-03 16:26:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:26:58,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:58,821 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:26:58,822 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:58,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1780208864, now seen corresponding path program 60 times [2018-12-03 16:26:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:00,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:00,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:00,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:00,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:00,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:00,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:00,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:00,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:00,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:00,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:00,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:00,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:04,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:04,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:27:04,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:04,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:27:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:27:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:27:04,821 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 64 states. [2018-12-03 16:27:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:05,003 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-03 16:27:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:27:05,003 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 138 [2018-12-03 16:27:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:05,004 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:27:05,004 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 16:27:05,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:27:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 16:27:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 16:27:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:27:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-12-03 16:27:05,010 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 138 [2018-12-03 16:27:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:05,010 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-12-03 16:27:05,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:27:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-12-03 16:27:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 16:27:05,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:05,011 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:05,012 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:05,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1304398628, now seen corresponding path program 61 times [2018-12-03 16:27:05,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:05,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:05,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:06,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:06,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:06,820 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:06,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:06,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:06,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:06,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:06,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:06,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:06,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:11,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:27:11,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:11,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:27:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:27:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:27:11,198 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 65 states. [2018-12-03 16:27:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:11,466 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-12-03 16:27:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:27:11,466 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 140 [2018-12-03 16:27:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:11,467 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:27:11,467 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:27:11,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:27:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:27:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 16:27:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 16:27:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-03 16:27:11,473 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 140 [2018-12-03 16:27:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:11,473 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-03 16:27:11,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:27:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-03 16:27:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:27:11,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:11,474 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:11,474 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:11,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2084764200, now seen corresponding path program 62 times [2018-12-03 16:27:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:13,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:13,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:13,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:13,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:13,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:13,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:13,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:13,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:13,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 16:27:13,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:13,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:13,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:18,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:18,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:27:18,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:18,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:27:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:27:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:27:18,004 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 66 states. [2018-12-03 16:27:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:18,197 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-12-03 16:27:18,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:27:18,198 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 142 [2018-12-03 16:27:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:18,199 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:27:18,199 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 16:27:18,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:27:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 16:27:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 16:27:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 16:27:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-12-03 16:27:18,205 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 142 [2018-12-03 16:27:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:18,206 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-12-03 16:27:18,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:27:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-12-03 16:27:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:27:18,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:18,206 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:18,207 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:18,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash -396802092, now seen corresponding path program 63 times [2018-12-03 16:27:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:18,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:18,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:18,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:20,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:20,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:20,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:20,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:20,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:20,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:20,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:20,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:20,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:20,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:20,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:20,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:25,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:25,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:27:25,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:25,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:27:25,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:27:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:27:25,111 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 67 states. [2018-12-03 16:27:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:25,229 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-03 16:27:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:27:25,230 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 144 [2018-12-03 16:27:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:25,231 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:27:25,231 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:27:25,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:27:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:27:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 16:27:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:27:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-03 16:27:25,239 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 144 [2018-12-03 16:27:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:25,240 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-03 16:27:25,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:27:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-03 16:27:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:27:25,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:25,241 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:25,241 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:25,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1762854192, now seen corresponding path program 64 times [2018-12-03 16:27:25,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:27,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:27,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:27,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:27,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:27,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:27,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:27,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:27,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:27,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4308 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:32,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:32,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:27:32,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:32,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:27:32,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:27:32,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:27:32,747 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 68 states. [2018-12-03 16:27:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:33,464 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-12-03 16:27:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:27:33,464 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 146 [2018-12-03 16:27:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:33,465 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:27:33,465 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:27:33,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:27:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:27:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 16:27:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 16:27:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-12-03 16:27:33,474 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 146 [2018-12-03 16:27:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:33,474 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-12-03 16:27:33,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:27:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-12-03 16:27:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:27:33,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:33,475 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:33,475 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:33,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -278929716, now seen corresponding path program 65 times [2018-12-03 16:27:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:33,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:33,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:33,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:35,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:35,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:35,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:35,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:35,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:35,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:35,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:35,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 16:27:35,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:35,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:35,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4440 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:40,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:40,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:27:40,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:40,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:27:40,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:27:40,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:27:40,451 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 69 states. [2018-12-03 16:27:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:40,619 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-12-03 16:27:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:27:40,620 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 148 [2018-12-03 16:27:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:40,621 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:27:40,621 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:27:40,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:27:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:27:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:27:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:27:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-12-03 16:27:40,629 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 148 [2018-12-03 16:27:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:40,629 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-12-03 16:27:40,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:27:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-12-03 16:27:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:27:40,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:40,630 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:40,631 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:40,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:40,631 INFO L82 PathProgramCache]: Analyzing trace with hash -156650552, now seen corresponding path program 66 times [2018-12-03 16:27:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:40,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:40,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:42,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:42,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:42,664 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:42,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:42,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:42,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:42,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:42,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:42,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:42,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:42,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4574 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:48,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:48,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:27:48,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:48,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:27:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:27:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:27:48,067 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 70 states. [2018-12-03 16:27:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:48,220 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-03 16:27:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:27:48,220 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 150 [2018-12-03 16:27:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:48,221 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:27:48,221 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 16:27:48,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:27:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 16:27:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 16:27:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 16:27:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-12-03 16:27:48,227 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 150 [2018-12-03 16:27:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:48,227 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-12-03 16:27:48,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:27:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2018-12-03 16:27:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:27:48,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:48,228 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:48,228 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:48,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1389509060, now seen corresponding path program 67 times [2018-12-03 16:27:48,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:48,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:48,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:48,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:48,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:49,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:49,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:49,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:49,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:49,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:49,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:50,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:50,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4710 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:55,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:55,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:27:55,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:55,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:27:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:27:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:27:55,374 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 71 states. [2018-12-03 16:27:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:55,517 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-12-03 16:27:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:27:55,517 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 152 [2018-12-03 16:27:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:55,518 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:27:55,518 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:27:55,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:27:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:27:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 16:27:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 16:27:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-12-03 16:27:55,525 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 152 [2018-12-03 16:27:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:55,525 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-12-03 16:27:55,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:27:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-12-03 16:27:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:27:55,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:55,526 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:27:55,526 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:55,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1190211776, now seen corresponding path program 68 times [2018-12-03 16:27:55,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:57,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:57,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:57,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:57,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:57,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:57,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:27:57,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:57,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:57,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 16:27:57,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:57,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:27:57,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4848 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:03,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:03,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:28:03,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:03,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:28:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:28:03,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:28:03,304 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 72 states. [2018-12-03 16:28:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:03,538 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-12-03 16:28:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:28:03,538 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 154 [2018-12-03 16:28:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:03,539 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:28:03,539 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 16:28:03,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:28:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 16:28:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 16:28:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 16:28:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-03 16:28:03,545 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 154 [2018-12-03 16:28:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:03,545 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-03 16:28:03,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:28:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-03 16:28:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:28:03,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:03,546 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:03,546 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:03,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:03,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1355917124, now seen corresponding path program 69 times [2018-12-03 16:28:03,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:03,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:03,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:03,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:03,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:05,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:05,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:05,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:05,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:05,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:05,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:05,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:05,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:05,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:05,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:05,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:05,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4988 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:11,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:28:11,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:11,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:28:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:28:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:28:11,201 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 73 states. [2018-12-03 16:28:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:11,393 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-12-03 16:28:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:28:11,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 156 [2018-12-03 16:28:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:11,395 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:28:11,395 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:28:11,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:28:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:28:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 16:28:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 16:28:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2018-12-03 16:28:11,402 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 156 [2018-12-03 16:28:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:11,402 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-12-03 16:28:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:28:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2018-12-03 16:28:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:28:11,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:11,403 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:11,403 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:11,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash -54431304, now seen corresponding path program 70 times [2018-12-03 16:28:11,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:11,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:11,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:13,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:13,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:13,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:13,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:13,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:13,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:13,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:13,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:13,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:13,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:19,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:19,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:28:19,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:19,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:28:19,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:28:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:28:19,597 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand 74 states. [2018-12-03 16:28:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:19,871 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-12-03 16:28:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:28:19,871 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 158 [2018-12-03 16:28:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:19,872 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:28:19,872 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:28:19,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:28:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:28:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 16:28:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:28:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-03 16:28:19,882 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 158 [2018-12-03 16:28:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:19,882 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-03 16:28:19,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:28:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-03 16:28:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 16:28:19,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:19,883 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:19,883 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:19,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash 837958580, now seen corresponding path program 71 times [2018-12-03 16:28:19,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:19,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:21,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:21,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:21,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:21,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:21,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:21,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:21,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:22,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 16:28:22,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:22,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:22,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5274 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:28,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:28,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:28:28,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:28,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:28:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:28:28,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:28:28,159 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 75 states. [2018-12-03 16:28:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:28,329 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-12-03 16:28:28,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:28:28,330 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 160 [2018-12-03 16:28:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:28,331 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:28:28,331 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:28:28,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:28:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:28:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 16:28:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 16:28:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-12-03 16:28:28,340 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 160 [2018-12-03 16:28:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:28,340 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-12-03 16:28:28,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:28:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-12-03 16:28:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:28:28,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:28,341 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:28,341 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:28,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash -568822096, now seen corresponding path program 72 times [2018-12-03 16:28:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:28,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:28,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:30,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:30,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:30,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:30,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:30,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:30,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:30,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:30,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:30,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:30,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:30,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5420 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:36,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:36,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:28:36,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:36,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:28:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:28:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:28:36,607 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 76 states. [2018-12-03 16:28:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:36,780 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-12-03 16:28:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:28:36,781 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 162 [2018-12-03 16:28:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:36,782 INFO L225 Difference]: With dead ends: 179 [2018-12-03 16:28:36,782 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 16:28:36,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:28:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 16:28:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 16:28:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:28:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-12-03 16:28:36,789 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 162 [2018-12-03 16:28:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:36,790 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-12-03 16:28:36,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:28:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-12-03 16:28:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 16:28:36,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:36,791 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:36,791 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:36,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 429646508, now seen corresponding path program 73 times [2018-12-03 16:28:36,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:36,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:36,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:36,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:36,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:39,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:39,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:39,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:39,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:39,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:39,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:39,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:39,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:39,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:45,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:45,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:28:45,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:45,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:28:45,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:28:45,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:28:45,619 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 77 states. [2018-12-03 16:28:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:45,779 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-12-03 16:28:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:28:45,780 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 164 [2018-12-03 16:28:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:45,780 INFO L225 Difference]: With dead ends: 181 [2018-12-03 16:28:45,781 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:28:45,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:28:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:28:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 16:28:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 16:28:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-12-03 16:28:45,787 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 164 [2018-12-03 16:28:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:45,788 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-12-03 16:28:45,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:28:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-12-03 16:28:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 16:28:45,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:45,789 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:45,789 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:45,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2114699352, now seen corresponding path program 74 times [2018-12-03 16:28:45,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:45,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:45,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:45,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:45,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:47,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:47,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:47,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:47,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:47,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:47,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:47,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:48,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-12-03 16:28:48,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:48,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:48,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:54,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:54,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:28:54,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:54,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:28:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:28:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:28:54,827 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 78 states. [2018-12-03 16:28:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:54,974 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-12-03 16:28:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:28:54,975 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 166 [2018-12-03 16:28:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:54,976 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:28:54,976 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 16:28:54,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:28:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 16:28:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 16:28:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 16:28:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-12-03 16:28:54,982 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 166 [2018-12-03 16:28:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:54,982 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-12-03 16:28:54,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:28:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-12-03 16:28:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 16:28:54,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:54,983 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:28:54,983 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:54,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 900287908, now seen corresponding path program 75 times [2018-12-03 16:28:54,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:54,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:54,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:57,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:57,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:57,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:57,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:57,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:57,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:28:57,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:57,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:57,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:57,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:57,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:28:57,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:03,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:03,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:29:03,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:29:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:29:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:29:03,750 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 79 states. [2018-12-03 16:29:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:04,033 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-12-03 16:29:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:29:04,033 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 168 [2018-12-03 16:29:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:04,034 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:29:04,034 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:29:04,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:29:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:29:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 16:29:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 16:29:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-03 16:29:04,040 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 168 [2018-12-03 16:29:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:04,041 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-03 16:29:04,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:29:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-03 16:29:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 16:29:04,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:04,042 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:29:04,042 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:04,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash -799880032, now seen corresponding path program 76 times [2018-12-03 16:29:04,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:04,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:04,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:04,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:06,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:06,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:06,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:06,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:06,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:06,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:06,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:06,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:06,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6024 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:13,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:13,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:29:13,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:29:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:29:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:29:13,325 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 80 states. [2018-12-03 16:29:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:13,485 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-12-03 16:29:13,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:29:13,485 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 170 [2018-12-03 16:29:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:13,486 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:29:13,486 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 16:29:13,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:29:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 16:29:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 16:29:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 16:29:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-12-03 16:29:13,495 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 170 [2018-12-03 16:29:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:13,495 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-12-03 16:29:13,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:29:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-12-03 16:29:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 16:29:13,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:13,496 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:29:13,497 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:13,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1721269404, now seen corresponding path program 77 times [2018-12-03 16:29:13,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:13,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:13,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:13,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:16,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:16,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:16,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:16,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:16,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:16,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 79 check-sat command(s) [2018-12-03 16:29:16,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:16,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:16,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:23,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:23,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:29:23,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:23,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:29:23,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:29:23,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:29:23,151 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 81 states. [2018-12-03 16:29:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:23,351 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-12-03 16:29:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:29:23,351 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 172 [2018-12-03 16:29:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:23,352 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:29:23,352 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 16:29:23,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:29:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 16:29:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 16:29:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:29:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-03 16:29:23,362 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 172 [2018-12-03 16:29:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:23,362 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-03 16:29:23,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:29:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-03 16:29:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:29:23,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:23,364 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:29:23,364 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:23,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2110644840, now seen corresponding path program 78 times [2018-12-03 16:29:23,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:23,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:23,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:23,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:23,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:26,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:26,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:26,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:26,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:26,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:26,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:26,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:26,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:26,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:26,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:26,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:26,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:33,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:33,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:29:33,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:33,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:29:33,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:29:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:29:33,343 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 82 states. [2018-12-03 16:29:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:33,601 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-12-03 16:29:33,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:29:33,602 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 174 [2018-12-03 16:29:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:33,603 INFO L225 Difference]: With dead ends: 191 [2018-12-03 16:29:33,603 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 16:29:33,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:29:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 16:29:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-03 16:29:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:29:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-12-03 16:29:33,609 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 174 [2018-12-03 16:29:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:33,609 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-12-03 16:29:33,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:29:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-12-03 16:29:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 16:29:33,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:33,610 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:29:33,610 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:33,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 501706644, now seen corresponding path program 79 times [2018-12-03 16:29:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:33,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:33,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:36,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:36,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:36,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:36,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:36,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:36,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:36,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:36,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:36,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:36,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:29:43,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:29:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:29:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:29:43,519 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 83 states. [2018-12-03 16:29:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:43,715 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-12-03 16:29:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:29:43,716 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 176 [2018-12-03 16:29:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:43,717 INFO L225 Difference]: With dead ends: 193 [2018-12-03 16:29:43,717 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:29:43,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:29:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:29:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 16:29:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 16:29:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-12-03 16:29:43,723 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 176 [2018-12-03 16:29:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:43,723 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-12-03 16:29:43,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:29:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2018-12-03 16:29:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 16:29:43,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:43,724 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:29:43,724 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:43,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1584385392, now seen corresponding path program 80 times [2018-12-03 16:29:43,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:43,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:46,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:46,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:46,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:46,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:46,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:46,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:46,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:46,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:46,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-12-03 16:29:46,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:46,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:46,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:54,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:54,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:29:54,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:54,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:29:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:29:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:29:54,236 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 84 states. [2018-12-03 16:29:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:54,400 INFO L93 Difference]: Finished difference Result 195 states and 199 transitions. [2018-12-03 16:29:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:29:54,400 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 178 [2018-12-03 16:29:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:54,402 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:29:54,402 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:29:54,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:29:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:29:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 16:29:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 16:29:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-12-03 16:29:54,408 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 178 [2018-12-03 16:29:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:54,408 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-12-03 16:29:54,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:29:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-12-03 16:29:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 16:29:54,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:54,409 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:29:54,409 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:54,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash -569104756, now seen corresponding path program 81 times [2018-12-03 16:29:54,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:54,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:54,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:57,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:57,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:57,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:57,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:57,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:57,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:29:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:57,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:57,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:57,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:57,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:29:57,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6824 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:04,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:04,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:30:04,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:04,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:30:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:30:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:30:04,861 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 85 states. [2018-12-03 16:30:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:05,157 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-12-03 16:30:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:30:05,158 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 180 [2018-12-03 16:30:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:05,159 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:30:05,159 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:30:05,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:30:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:30:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 16:30:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 16:30:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2018-12-03 16:30:05,166 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 180 [2018-12-03 16:30:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:05,166 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2018-12-03 16:30:05,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:30:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2018-12-03 16:30:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 16:30:05,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:05,168 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:30:05,168 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:05,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:05,168 INFO L82 PathProgramCache]: Analyzing trace with hash 158010248, now seen corresponding path program 82 times [2018-12-03 16:30:05,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:05,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:05,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:05,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:05,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:08,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:08,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:08,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:08,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:08,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:08,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:08,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:08,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:08,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6990 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:16,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:16,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:30:16,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:16,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:30:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:30:16,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:30:16,295 INFO L87 Difference]: Start difference. First operand 183 states and 185 transitions. Second operand 86 states. [2018-12-03 16:30:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:16,498 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-12-03 16:30:16,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:30:16,499 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 182 [2018-12-03 16:30:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:16,500 INFO L225 Difference]: With dead ends: 199 [2018-12-03 16:30:16,500 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 16:30:16,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:30:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 16:30:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-03 16:30:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 16:30:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-12-03 16:30:16,508 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 182 [2018-12-03 16:30:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:16,508 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-12-03 16:30:16,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:30:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-12-03 16:30:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 16:30:16,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:16,510 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:30:16,510 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:16,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:16,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1164140156, now seen corresponding path program 83 times [2018-12-03 16:30:16,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:16,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:16,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:19,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:19,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:19,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:19,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:19,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:19,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:19,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:19,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:19,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2018-12-03 16:30:19,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:19,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:19,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7158 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:27,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:27,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:30:27,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:27,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:30:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:30:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:30:27,694 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 87 states. [2018-12-03 16:30:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:27,874 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-12-03 16:30:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:30:27,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 184 [2018-12-03 16:30:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:27,876 INFO L225 Difference]: With dead ends: 201 [2018-12-03 16:30:27,876 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 16:30:27,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:30:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 16:30:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 16:30:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 16:30:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2018-12-03 16:30:27,886 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 184 [2018-12-03 16:30:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:27,886 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2018-12-03 16:30:27,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:30:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2018-12-03 16:30:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 16:30:27,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:27,887 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:30:27,888 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:27,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash -440358784, now seen corresponding path program 84 times [2018-12-03 16:30:27,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:27,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:27,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:30,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:30,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:30,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:30,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:30,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:30,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:30,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:30,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:30,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:30,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:30,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:30,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7328 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:39,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:39,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:30:39,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:39,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:30:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:30:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:30:39,246 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand 88 states. [2018-12-03 16:30:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:39,450 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2018-12-03 16:30:39,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:30:39,451 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 186 [2018-12-03 16:30:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:39,452 INFO L225 Difference]: With dead ends: 203 [2018-12-03 16:30:39,452 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 16:30:39,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:30:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 16:30:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 16:30:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 16:30:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2018-12-03 16:30:39,461 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 186 [2018-12-03 16:30:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:39,462 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2018-12-03 16:30:39,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:30:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2018-12-03 16:30:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 16:30:39,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:39,463 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:30:39,463 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:39,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash -671162244, now seen corresponding path program 85 times [2018-12-03 16:30:39,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:39,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:39,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:39,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:39,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:42,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:42,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:42,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:42,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:42,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:42,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:42,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:42,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:42,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:42,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:51,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:51,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:30:51,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:51,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:30:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:30:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:30:51,234 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand 89 states. [2018-12-03 16:30:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:51,406 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-12-03 16:30:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:30:51,406 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 188 [2018-12-03 16:30:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:51,408 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:30:51,408 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 16:30:51,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:30:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 16:30:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 16:30:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 16:30:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2018-12-03 16:30:51,416 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 188 [2018-12-03 16:30:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:51,416 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2018-12-03 16:30:51,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:30:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2018-12-03 16:30:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 16:30:51,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:51,417 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:30:51,417 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:51,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash 865012088, now seen corresponding path program 86 times [2018-12-03 16:30:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:51,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:54,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:54,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:54,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:54,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:54,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:54,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:54,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:54,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:54,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-12-03 16:30:54,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:54,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:30:54,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7674 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:03,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:03,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:31:03,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:03,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:31:03,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:31:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:31:03,343 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 90 states. [2018-12-03 16:31:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:03,635 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2018-12-03 16:31:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:31:03,636 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 190 [2018-12-03 16:31:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:03,637 INFO L225 Difference]: With dead ends: 207 [2018-12-03 16:31:03,637 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 16:31:03,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:31:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 16:31:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 16:31:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 16:31:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2018-12-03 16:31:03,643 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 190 [2018-12-03 16:31:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:03,643 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2018-12-03 16:31:03,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:31:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2018-12-03 16:31:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 16:31:03,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:03,644 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:31:03,644 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:03,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash -340204684, now seen corresponding path program 87 times [2018-12-03 16:31:03,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:03,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:03,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:06,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:06,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:06,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:06,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:06,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:06,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:06,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:06,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:06,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:06,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:06,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7850 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:15,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:15,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:31:15,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:15,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:31:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:31:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:31:15,708 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand 91 states. [2018-12-03 16:31:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:16,073 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-12-03 16:31:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:31:16,074 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 192 [2018-12-03 16:31:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:16,075 INFO L225 Difference]: With dead ends: 209 [2018-12-03 16:31:16,075 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 16:31:16,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:31:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 16:31:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 16:31:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 16:31:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-12-03 16:31:16,082 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 192 [2018-12-03 16:31:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:16,082 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-12-03 16:31:16,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:31:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-12-03 16:31:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 16:31:16,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:16,083 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:31:16,083 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:16,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1087647344, now seen corresponding path program 88 times [2018-12-03 16:31:16,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:16,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:16,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:16,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:16,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:19,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:19,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:19,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:19,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:19,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:19,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:19,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:19,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:19,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:19,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8028 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:28,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:28,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:31:28,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:28,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:31:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:31:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:31:28,554 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 92 states. [2018-12-03 16:31:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:28,906 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-12-03 16:31:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:31:28,907 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 194 [2018-12-03 16:31:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:28,908 INFO L225 Difference]: With dead ends: 211 [2018-12-03 16:31:28,908 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 16:31:28,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:31:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 16:31:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-03 16:31:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 16:31:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 199 transitions. [2018-12-03 16:31:28,918 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 199 transitions. Word has length 194 [2018-12-03 16:31:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:28,918 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 199 transitions. [2018-12-03 16:31:28,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:31:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 199 transitions. [2018-12-03 16:31:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 16:31:28,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:28,919 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:31:28,919 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:28,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1136088468, now seen corresponding path program 89 times [2018-12-03 16:31:28,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:28,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:28,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:31,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:31,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:31,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:31,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:31,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:31,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:31,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:31,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:32,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 91 check-sat command(s) [2018-12-03 16:31:32,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:32,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:32,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:41,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:41,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:31:41,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:41,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:31:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:31:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:31:41,642 INFO L87 Difference]: Start difference. First operand 197 states and 199 transitions. Second operand 93 states. [2018-12-03 16:31:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:41,895 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-12-03 16:31:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:31:41,895 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 196 [2018-12-03 16:31:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:41,897 INFO L225 Difference]: With dead ends: 213 [2018-12-03 16:31:41,897 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 16:31:41,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:31:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 16:31:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 16:31:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 16:31:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-12-03 16:31:41,903 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 196 [2018-12-03 16:31:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:41,903 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-12-03 16:31:41,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:31:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-12-03 16:31:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 16:31:41,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:41,904 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:31:41,904 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:41,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 747509608, now seen corresponding path program 90 times [2018-12-03 16:31:41,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:41,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:41,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:45,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:45,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:45,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:45,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:45,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:45,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:45,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:45,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:45,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:45,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:45,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:45,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8390 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:54,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:54,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:31:54,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:54,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:31:54,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:31:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:31:54,898 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 94 states. [2018-12-03 16:31:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:55,159 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2018-12-03 16:31:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:31:55,160 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 198 [2018-12-03 16:31:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:55,161 INFO L225 Difference]: With dead ends: 215 [2018-12-03 16:31:55,161 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 16:31:55,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:31:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 16:31:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-03 16:31:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 16:31:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-12-03 16:31:55,168 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 198 [2018-12-03 16:31:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:55,168 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-12-03 16:31:55,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:31:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-12-03 16:31:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 16:31:55,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:55,169 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:31:55,169 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1590938268, now seen corresponding path program 91 times [2018-12-03 16:31:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:55,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:55,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:58,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:58,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:58,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:58,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:58,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:58,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:58,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:58,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:31:58,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8574 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:08,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:08,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:32:08,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:08,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:32:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:32:08,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:32:08,181 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 95 states. [2018-12-03 16:32:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:08,509 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-12-03 16:32:08,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:32:08,509 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 200 [2018-12-03 16:32:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:08,510 INFO L225 Difference]: With dead ends: 217 [2018-12-03 16:32:08,510 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 16:32:08,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:32:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 16:32:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 16:32:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 16:32:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-12-03 16:32:08,517 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 200 [2018-12-03 16:32:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:08,518 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-12-03 16:32:08,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:32:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-12-03 16:32:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 16:32:08,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:08,518 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:32:08,519 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:08,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:08,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1723516000, now seen corresponding path program 92 times [2018-12-03 16:32:08,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:08,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:08,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:08,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:11,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:11,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:11,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:11,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:11,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:11,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:11,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:11,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:12,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-12-03 16:32:12,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:12,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:12,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8760 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:22,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:22,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:32:22,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:22,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:32:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:32:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:32:22,104 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 96 states. [2018-12-03 16:32:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:22,514 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-12-03 16:32:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:32:22,515 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 202 [2018-12-03 16:32:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:22,516 INFO L225 Difference]: With dead ends: 219 [2018-12-03 16:32:22,516 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 16:32:22,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:32:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 16:32:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 16:32:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 16:32:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-12-03 16:32:22,523 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 202 [2018-12-03 16:32:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:22,523 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-12-03 16:32:22,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:32:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2018-12-03 16:32:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 16:32:22,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:22,524 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:32:22,524 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:22,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 48333916, now seen corresponding path program 93 times [2018-12-03 16:32:22,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:22,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:22,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:26,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:26,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:26,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:26,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:26,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:26,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:26,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:26,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:26,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:26,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:26,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:26,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8948 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:36,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:36,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:32:36,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:36,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:32:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:32:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:32:36,652 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand 97 states. [2018-12-03 16:32:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:36,929 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2018-12-03 16:32:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:32:36,930 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 204 [2018-12-03 16:32:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:36,931 INFO L225 Difference]: With dead ends: 221 [2018-12-03 16:32:36,931 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 16:32:36,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:32:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 16:32:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-03 16:32:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 16:32:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 209 transitions. [2018-12-03 16:32:36,938 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 209 transitions. Word has length 204 [2018-12-03 16:32:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:36,938 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 209 transitions. [2018-12-03 16:32:36,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:32:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-12-03 16:32:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 16:32:36,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:36,941 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:32:36,942 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:36,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash 811087192, now seen corresponding path program 94 times [2018-12-03 16:32:36,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:36,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:36,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:40,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:40,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:40,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:40,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:40,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:40,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:40,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:40,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:40,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9138 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:51,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:51,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 16:32:51,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:51,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:32:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:32:51,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:32:51,075 INFO L87 Difference]: Start difference. First operand 207 states and 209 transitions. Second operand 98 states. [2018-12-03 16:32:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:51,348 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-12-03 16:32:51,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:32:51,348 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 206 [2018-12-03 16:32:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:51,349 INFO L225 Difference]: With dead ends: 223 [2018-12-03 16:32:51,349 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 16:32:51,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:32:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 16:32:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-03 16:32:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 16:32:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2018-12-03 16:32:51,357 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 206 [2018-12-03 16:32:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:51,358 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2018-12-03 16:32:51,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:32:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2018-12-03 16:32:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 16:32:51,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:51,359 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:32:51,359 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:51,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -622422188, now seen corresponding path program 95 times [2018-12-03 16:32:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:51,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:51,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:55,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:55,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:55,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:55,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:55,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:55,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:55,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:55,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:55,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 97 check-sat command(s) [2018-12-03 16:32:55,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:55,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:32:55,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9330 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:06,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:06,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 16:33:06,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:06,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 16:33:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 16:33:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:33:06,073 INFO L87 Difference]: Start difference. First operand 209 states and 211 transitions. Second operand 99 states. [2018-12-03 16:33:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:06,512 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-03 16:33:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:33:06,513 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 208 [2018-12-03 16:33:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:06,514 INFO L225 Difference]: With dead ends: 225 [2018-12-03 16:33:06,514 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 16:33:06,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:33:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 16:33:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 16:33:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 16:33:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-12-03 16:33:06,521 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 208 [2018-12-03 16:33:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-12-03 16:33:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 16:33:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-12-03 16:33:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 16:33:06,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:06,522 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:33:06,522 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:06,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:06,522 INFO L82 PathProgramCache]: Analyzing trace with hash 459565648, now seen corresponding path program 96 times [2018-12-03 16:33:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:06,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:06,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:10,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:10,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:10,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:10,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:10,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:10,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:10,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:10,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:10,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:10,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:10,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:10,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 16:33:21,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:21,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:33:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:33:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:33:21,257 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 100 states. [2018-12-03 16:33:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:21,718 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-12-03 16:33:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:33:21,718 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 210 [2018-12-03 16:33:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:21,719 INFO L225 Difference]: With dead ends: 227 [2018-12-03 16:33:21,719 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 16:33:21,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:33:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 16:33:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 16:33:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:33:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-12-03 16:33:21,726 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 210 [2018-12-03 16:33:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:21,726 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-12-03 16:33:21,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:33:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-12-03 16:33:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 16:33:21,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:21,727 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:33:21,727 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:21,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash 867790412, now seen corresponding path program 97 times [2018-12-03 16:33:21,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:21,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:21,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:21,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:21,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:25,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:25,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:25,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:25,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:25,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:25,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:25,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:25,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:25,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:36,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:36,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 16:33:36,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:36,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:33:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:33:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:33:36,758 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 101 states. [2018-12-03 16:33:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:37,107 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-12-03 16:33:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:33:37,107 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 212 [2018-12-03 16:33:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:37,109 INFO L225 Difference]: With dead ends: 229 [2018-12-03 16:33:37,109 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 16:33:37,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:33:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 16:33:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-12-03 16:33:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-03 16:33:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 217 transitions. [2018-12-03 16:33:37,119 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 217 transitions. Word has length 212 [2018-12-03 16:33:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 217 transitions. [2018-12-03 16:33:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:33:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 217 transitions. [2018-12-03 16:33:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-03 16:33:37,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:37,120 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:33:37,120 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:37,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1965202616, now seen corresponding path program 98 times [2018-12-03 16:33:37,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:37,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:37,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:41,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:41,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:41,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:41,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:41,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:41,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:41,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:41,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:41,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 16:33:41,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:41,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:41,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9918 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:52,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:52,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 16:33:52,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:52,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:33:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:33:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:33:52,660 INFO L87 Difference]: Start difference. First operand 215 states and 217 transitions. Second operand 102 states. [2018-12-03 16:33:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:53,000 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-12-03 16:33:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:33:53,001 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 214 [2018-12-03 16:33:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:53,002 INFO L225 Difference]: With dead ends: 231 [2018-12-03 16:33:53,002 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 16:33:53,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:33:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 16:33:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-12-03 16:33:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-03 16:33:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-12-03 16:33:53,012 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 214 [2018-12-03 16:33:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:53,012 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-12-03 16:33:53,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:33:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-12-03 16:33:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-03 16:33:53,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:53,013 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:33:53,014 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:53,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1462236860, now seen corresponding path program 99 times [2018-12-03 16:33:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:53,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:53,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:57,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:57,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:57,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:57,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:57,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:57,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:57,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:57,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:57,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:57,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:57,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:33:57,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10118 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:08,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:08,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 16:34:08,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:08,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:34:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:34:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:34:08,703 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 103 states. [2018-12-03 16:34:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:09,105 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-12-03 16:34:09,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:34:09,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 216 [2018-12-03 16:34:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:09,107 INFO L225 Difference]: With dead ends: 233 [2018-12-03 16:34:09,107 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 16:34:09,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:34:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 16:34:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-03 16:34:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-03 16:34:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 221 transitions. [2018-12-03 16:34:09,118 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 221 transitions. Word has length 216 [2018-12-03 16:34:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:09,118 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 221 transitions. [2018-12-03 16:34:09,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:34:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 221 transitions. [2018-12-03 16:34:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 16:34:09,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:09,119 INFO L402 BasicCegarLoop]: trace histogram [102, 101, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:34:09,120 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:09,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash 851517504, now seen corresponding path program 100 times [2018-12-03 16:34:09,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:09,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:09,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:09,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:09,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:13,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:13,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:13,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:13,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:13,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:13,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:13,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:13,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:13,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:13,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:25,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:25,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 16:34:25,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:25,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:34:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:34:25,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:34:25,160 INFO L87 Difference]: Start difference. First operand 219 states and 221 transitions. Second operand 104 states. [2018-12-03 16:34:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:25,637 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-12-03 16:34:25,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:34:25,638 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 218 [2018-12-03 16:34:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:25,639 INFO L225 Difference]: With dead ends: 235 [2018-12-03 16:34:25,639 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 16:34:25,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:34:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 16:34:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-12-03 16:34:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-03 16:34:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-12-03 16:34:25,647 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 218 [2018-12-03 16:34:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:25,648 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-12-03 16:34:25,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:34:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-12-03 16:34:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 16:34:25,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:25,649 INFO L402 BasicCegarLoop]: trace histogram [103, 102, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:34:25,649 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:25,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -423598020, now seen corresponding path program 101 times [2018-12-03 16:34:25,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:25,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:25,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:25,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:25,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:29,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:29,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:29,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:29,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:29,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:29,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:29,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:29,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:30,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 103 check-sat command(s) [2018-12-03 16:34:30,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:30,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:30,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10524 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:41,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:41,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 16:34:41,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:41,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:34:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:34:41,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:34:41,949 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 105 states. [2018-12-03 16:34:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:42,467 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-12-03 16:34:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:34:42,468 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 220 [2018-12-03 16:34:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:42,469 INFO L225 Difference]: With dead ends: 237 [2018-12-03 16:34:42,469 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 16:34:42,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:34:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 16:34:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-03 16:34:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-03 16:34:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 225 transitions. [2018-12-03 16:34:42,478 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 225 transitions. Word has length 220 [2018-12-03 16:34:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:42,479 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 225 transitions. [2018-12-03 16:34:42,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:34:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 225 transitions. [2018-12-03 16:34:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 16:34:42,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:42,479 INFO L402 BasicCegarLoop]: trace histogram [104, 103, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:34:42,480 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:42,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1743937224, now seen corresponding path program 102 times [2018-12-03 16:34:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:42,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:42,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:46,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:46,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:46,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:46,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:46,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:46,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:46,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:46,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:46,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:46,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10730 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:34:58,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:58,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:34:58,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:58,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:34:58,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:34:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:34:58,893 INFO L87 Difference]: Start difference. First operand 223 states and 225 transitions. Second operand 106 states. [2018-12-03 16:34:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:59,353 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-12-03 16:34:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:34:59,353 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 222 [2018-12-03 16:34:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:59,354 INFO L225 Difference]: With dead ends: 239 [2018-12-03 16:34:59,354 INFO L226 Difference]: Without dead ends: 225 [2018-12-03 16:34:59,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:34:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-03 16:34:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-12-03 16:34:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 16:34:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-12-03 16:34:59,362 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 222 [2018-12-03 16:34:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:59,362 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-12-03 16:34:59,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:34:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-12-03 16:34:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-03 16:34:59,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:59,363 INFO L402 BasicCegarLoop]: trace histogram [105, 104, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:34:59,363 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:59,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 720407348, now seen corresponding path program 103 times [2018-12-03 16:34:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:59,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:59,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:03,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:03,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:03,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:03,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:03,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:03,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:03,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:03,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10938 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:16,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:16,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 16:35:16,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:16,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:35:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:35:16,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:35:16,141 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 107 states. [2018-12-03 16:35:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:16,709 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-12-03 16:35:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:35:16,710 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 224 [2018-12-03 16:35:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:16,711 INFO L225 Difference]: With dead ends: 241 [2018-12-03 16:35:16,711 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 16:35:16,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:35:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 16:35:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-12-03 16:35:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 16:35:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2018-12-03 16:35:16,721 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 224 [2018-12-03 16:35:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:16,722 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2018-12-03 16:35:16,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:35:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2018-12-03 16:35:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 16:35:16,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:16,723 INFO L402 BasicCegarLoop]: trace histogram [106, 105, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:35:16,723 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:16,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1866406352, now seen corresponding path program 104 times [2018-12-03 16:35:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:16,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:21,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:21,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:21,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:21,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:21,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:21,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:21,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:21,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:21,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-12-03 16:35:21,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:21,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:21,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11148 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 16:35:34,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:35:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:35:34,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:35:34,380 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 108 states. [2018-12-03 16:35:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:34,801 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-12-03 16:35:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:35:34,802 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 226 [2018-12-03 16:35:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:34,803 INFO L225 Difference]: With dead ends: 243 [2018-12-03 16:35:34,803 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 16:35:34,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:35:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 16:35:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-12-03 16:35:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-03 16:35:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 231 transitions. [2018-12-03 16:35:34,810 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 231 transitions. Word has length 226 [2018-12-03 16:35:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:34,810 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 231 transitions. [2018-12-03 16:35:34,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:35:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2018-12-03 16:35:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-03 16:35:34,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:34,811 INFO L402 BasicCegarLoop]: trace histogram [107, 106, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:35:34,811 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:34,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1008307668, now seen corresponding path program 105 times [2018-12-03 16:35:34,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:34,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:34,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:39,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:39,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:39,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:39,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:39,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:39,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:39,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:35:39,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:35:39,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:35:39,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:39,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:39,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 11360 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:52,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:52,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 16:35:52,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:52,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 16:35:52,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 16:35:52,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:35:52,340 INFO L87 Difference]: Start difference. First operand 229 states and 231 transitions. Second operand 109 states. [2018-12-03 16:35:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:52,934 INFO L93 Difference]: Finished difference Result 245 states and 249 transitions. [2018-12-03 16:35:52,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:35:52,935 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 228 [2018-12-03 16:35:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:52,935 INFO L225 Difference]: With dead ends: 245 [2018-12-03 16:35:52,936 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 16:35:52,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:35:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 16:35:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-03 16:35:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 16:35:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-12-03 16:35:52,944 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 228 [2018-12-03 16:35:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:52,944 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-12-03 16:35:52,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 16:35:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-12-03 16:35:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 16:35:52,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:52,945 INFO L402 BasicCegarLoop]: trace histogram [108, 107, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:35:52,945 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:52,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1009193176, now seen corresponding path program 106 times [2018-12-03 16:35:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:52,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:52,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:57,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:57,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:57,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:57,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:57,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:57,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:57,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:57,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:57,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:35:57,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11574 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 16:36:10,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:10,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:36:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:36:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:36:10,856 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 110 states. [2018-12-03 16:36:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:11,255 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2018-12-03 16:36:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:36:11,256 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 230 [2018-12-03 16:36:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:11,257 INFO L225 Difference]: With dead ends: 247 [2018-12-03 16:36:11,257 INFO L226 Difference]: Without dead ends: 233 [2018-12-03 16:36:11,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:36:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-03 16:36:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-12-03 16:36:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-03 16:36:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 235 transitions. [2018-12-03 16:36:11,264 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 235 transitions. Word has length 230 [2018-12-03 16:36:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:11,264 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 235 transitions. [2018-12-03 16:36:11,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:36:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 235 transitions. [2018-12-03 16:36:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 16:36:11,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:11,265 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:36:11,265 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:11,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1860166364, now seen corresponding path program 107 times [2018-12-03 16:36:11,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:11,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:15,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:15,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:15,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:15,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:15,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:15,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:15,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:15,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:16,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 109 check-sat command(s) [2018-12-03 16:36:16,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:16,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:16,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11790 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:29,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:29,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 16:36:29,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:29,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 16:36:29,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 16:36:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:36:29,470 INFO L87 Difference]: Start difference. First operand 233 states and 235 transitions. Second operand 111 states. [2018-12-03 16:36:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:29,816 INFO L93 Difference]: Finished difference Result 249 states and 253 transitions. [2018-12-03 16:36:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:36:29,816 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 232 [2018-12-03 16:36:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:29,817 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:36:29,817 INFO L226 Difference]: Without dead ends: 235 [2018-12-03 16:36:29,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:36:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-03 16:36:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-12-03 16:36:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 16:36:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-12-03 16:36:29,825 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 232 [2018-12-03 16:36:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:29,826 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-12-03 16:36:29,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 16:36:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-12-03 16:36:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-03 16:36:29,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:29,826 INFO L402 BasicCegarLoop]: trace histogram [110, 109, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:36:29,827 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:29,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 693353504, now seen corresponding path program 108 times [2018-12-03 16:36:29,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:29,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:29,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:34,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:34,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:34,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:34,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:34,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:34,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:34,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:36:34,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:36:34,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:36:34,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:34,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:34,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12008 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:48,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:48,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 16:36:48,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:48,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:36:48,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:36:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:36:48,231 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 112 states. [2018-12-03 16:36:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:48,684 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2018-12-03 16:36:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:36:48,685 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 234 [2018-12-03 16:36:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:48,686 INFO L225 Difference]: With dead ends: 251 [2018-12-03 16:36:48,686 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 16:36:48,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:36:48,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 16:36:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 16:36:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 16:36:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 239 transitions. [2018-12-03 16:36:48,693 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 239 transitions. Word has length 234 [2018-12-03 16:36:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:48,693 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 239 transitions. [2018-12-03 16:36:48,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:36:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 239 transitions. [2018-12-03 16:36:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 16:36:48,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:48,694 INFO L402 BasicCegarLoop]: trace histogram [111, 110, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:36:48,694 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:48,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2095346660, now seen corresponding path program 109 times [2018-12-03 16:36:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:48,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:48,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12228 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:53,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:53,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:53,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:53,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:53,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:53,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:53,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:53,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:36:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:53,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12228 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:36:53,777 INFO L316 TraceCheckSpWp]: Computing backward predicates...