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/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:25:28,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:25:28,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:25:28,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:25:28,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:25:28,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:25:28,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:25:28,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:25:28,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:25:28,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:25:28,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:25:28,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:25:28,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:25:28,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:25:28,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:25:28,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:25:28,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:25:28,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:25:28,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:25:28,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:25:28,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:25:28,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:25:28,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:25:28,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:25:28,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:25:28,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:25:28,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:25:28,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:25:28,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:25:28,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:25:28,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:25:28,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:25:28,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:25:28,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:25:28,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:25:28,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:25:28,784 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:25:28,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:25:28,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:25:28,801 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:25:28,802 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:25:28,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:25:28,802 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:25:28,802 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:25:28,802 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:25:28,803 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:25:28,803 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:25:28,803 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:25:28,803 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:25:28,803 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:25:28,804 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:25:28,804 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:25:28,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:25:28,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:25:28,805 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:25:28,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:25:28,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:25:28,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:25:28,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:25:28,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:25:28,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:25:28,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:25:28,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:25:28,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:25:28,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:25:28,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:25:28,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:25:28,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:25:28,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:25:28,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:25:28,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:25:28,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:25:28,809 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:25:28,809 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:25:28,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:25:28,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:25:28,809 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:25:28,810 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:25:28,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:25:28,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:25:28,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:25:28,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:25:28,867 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:25:28,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 16:25:28,868 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-12-03 16:25:28,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:25:28,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:25:28,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:28,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:25:28,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:25:28,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:28,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:25:28,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:25:28,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:25:28,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... [2018-12-03 16:25:28,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:25:28,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:25:28,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:25:28,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:25:28,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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:25:29,070 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:25:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:25:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:25:29,313 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:25:29,314 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:25:29,314 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:29 BoogieIcfgContainer [2018-12-03 16:25:29,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:25:29,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:25:29,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:25:29,319 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:25:29,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:28" (1/2) ... [2018-12-03 16:25:29,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bebc3b0 and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:25:29, skipping insertion in model container [2018-12-03 16:25:29,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:29" (2/2) ... [2018-12-03 16:25:29,322 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 16:25:29,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:25:29,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:25:29,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:25:29,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:25:29,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:25:29,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:25:29,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:25:29,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:25:29,399 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:25:29,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:25:29,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:25:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 16:25:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:25:29,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:29,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:25:29,426 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:29,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:25:29,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:29,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:29,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:29,592 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:25:29,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:29,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:29,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:29,613 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 16:25:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:29,676 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 16:25:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:29,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:25:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:29,691 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:25:29,691 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:25:29,695 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:25:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:25:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 16:25:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:25:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 16:25:29,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 16:25:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:29,744 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 16:25:29,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 16:25:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:25:29,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:29,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:25:29,746 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-12-03 16:25:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:29,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:29,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:25:29,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:29,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:29,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:29,824 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-12-03 16:25:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:29,888 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 16:25:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:29,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:25:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:29,889 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:25:29,889 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:25:29,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:25:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:25:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:25:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:25:29,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 16:25:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:29,894 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:25:29,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:25:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:25:29,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:29,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:25:29,895 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:29,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-12-03 16:25:29,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:29,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:29,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:29,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:29,979 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 16:25:29,981 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 16:25:30,022 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:25:30,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:25:30,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:25:30,409 INFO L272 AbstractInterpreter]: Visited 6 different actions 24 times. Merged at 5 different actions 12 times. Widened at 1 different actions 2 times. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:25:30,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:30,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:25:30,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,438 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:25:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:30,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:30,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:30,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 16:25:30,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:30,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:25:30,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:25:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:30,591 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 16:25:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:30,629 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 16:25:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:25:30,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 16:25:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:30,631 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:25:30,632 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:25:30,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:25:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:25:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:25:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 16:25:30,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 16:25:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:30,636 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 16:25:30,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:25:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 16:25:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:25:30,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:30,637 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 16:25:30,638 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:30,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-12-03 16:25:30,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:30,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:25:30,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:30,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:30,705 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,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,705 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:25:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:30,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:30,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:25:30,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:30,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:25:30,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:25:30,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:30,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:25:30,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:30,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:25:30,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:25:30,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:30,797 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 16:25:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:30,871 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 16:25:30,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:25:30,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 16:25:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:30,872 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:25:30,872 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:25:30,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:25:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:25:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 16:25:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:25:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:25:30,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 16:25:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:30,880 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:25:30,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:25:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:25:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:25:30,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:30,881 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 16:25:30,881 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:30,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-12-03 16:25:30,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:30,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:30,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:25:31,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:31,011 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:31,012 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:31,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,012 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:25:31,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:31,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:31,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:31,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:31,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:25:31,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:25:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-03 16:25:31,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:31,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:25:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:25:31,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:31,319 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-03 16:25:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:31,366 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 16:25:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:25:31,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-03 16:25:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:31,368 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:25:31,369 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:25:31,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:25:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:25:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:25:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:25:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 16:25:31,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 16:25:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:31,374 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 16:25:31,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:25:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 16:25:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:25:31,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:31,375 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 16:25:31,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:31,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-12-03 16:25:31,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:31,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:25:31,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:31,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:31,498 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:31,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,499 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:25:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:31,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:25:31,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:25:31,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 16:25:31,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:31,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:25:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:25:31,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:25:31,740 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-12-03 16:25:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:31,769 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 16:25:31,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:25:31,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-03 16:25:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:31,772 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:25:31,772 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:25:31,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:25:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:25:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:25:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:25:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 16:25:31,778 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 16:25:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:31,778 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 16:25:31,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:25:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 16:25:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:25:31,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:31,779 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 16:25:31,780 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:31,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-12-03 16:25:31,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:25:31,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:31,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:31,843 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:31,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:31,843 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:25:31,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:31,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:31,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:25:31,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:31,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:25:31,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:25:32,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:32,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2018-12-03 16:25:32,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:32,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:25:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:25:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:25:32,541 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-12-03 16:25:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:32,904 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-12-03 16:25:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:25:32,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 16:25:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:32,906 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:25:32,906 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:25:32,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:25:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:25:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-12-03 16:25:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:25:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-03 16:25:32,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-12-03 16:25:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:32,915 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-03 16:25:32,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:25:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-03 16:25:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:25:32,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:32,917 INFO L402 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-12-03 16:25:32,917 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:32,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 6 times [2018-12-03 16:25:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:32,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 16:25:33,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:33,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:33,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:33,190 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,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:33,190 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:25:33,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:33,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:33,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:33,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:33,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 16:25:33,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 16:25:33,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:33,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2018-12-03 16:25:33,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:33,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:25:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:25:33,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:25:33,563 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-12-03 16:25:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:34,027 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-03 16:25:34,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:25:34,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-03 16:25:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:34,028 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:25:34,028 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:25:34,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:25:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:25:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-12-03 16:25:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:25:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-03 16:25:34,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-12-03 16:25:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:34,039 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-03 16:25:34,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:25:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-03 16:25:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:25:34,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:34,040 INFO L402 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-12-03 16:25:34,040 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:34,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 7 times [2018-12-03 16:25:34,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:34,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:34,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:34,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:34,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 16:25:34,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:34,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:34,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:34,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:25:34,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:34,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 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:25:34,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:34,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:34,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 16:25:34,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 16:25:34,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:34,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2018-12-03 16:25:34,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:34,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:25:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:25:34,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:25:34,513 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-12-03 16:25:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:34,555 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-03 16:25:34,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:25:34,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-03 16:25:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:34,559 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:25:34,559 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:25:34,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:25:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:25:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:25:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:25:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-03 16:25:34,567 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-12-03 16:25:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:34,567 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-03 16:25:34,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:25:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-03 16:25:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:25:34,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:34,569 INFO L402 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-12-03 16:25:34,569 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:34,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 8 times [2018-12-03 16:25:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:34,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-03 16:25:34,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:34,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:34,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:34,704 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:34,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:34,705 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:25:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:34,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:34,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:25:34,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:34,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-03 16:25:34,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-03 16:25:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:35,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 17 [2018-12-03 16:25:35,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:35,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:25:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:25:35,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:25:35,011 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-12-03 16:25:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:36,689 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-12-03 16:25:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:25:36,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 16:25:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:36,700 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:25:36,700 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:25:36,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1046, Invalid=2146, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:25:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:25:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-03 16:25:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:25:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 16:25:36,714 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-12-03 16:25:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:36,714 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 16:25:36,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:25:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 16:25:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:25:36,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:36,716 INFO L402 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-12-03 16:25:36,716 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:36,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 9 times [2018-12-03 16:25:36,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:36,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:36,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:36,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:36,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 16:25:36,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:36,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:36,841 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:36,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,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 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:25:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:36,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:36,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:36,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:36,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-03 16:25:37,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-03 16:25:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:37,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 18 [2018-12-03 16:25:37,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:37,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:25:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:25:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:37,478 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-12-03 16:25:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:38,910 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-03 16:25:38,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:25:38,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-12-03 16:25:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:38,918 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:25:38,918 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:25:38,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1605, Invalid=3507, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:25:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:25:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-12-03 16:25:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:25:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-03 16:25:38,946 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-12-03 16:25:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:38,946 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-03 16:25:38,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:25:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-03 16:25:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:25:38,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:38,949 INFO L402 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-12-03 16:25:38,950 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:38,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 10 times [2018-12-03 16:25:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:38,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:38,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-03 16:25:39,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:39,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:39,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:39,278 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:39,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:39,279 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:25:39,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:39,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:39,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-03 16:25:39,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-03 16:25:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 19 [2018-12-03 16:25:39,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:25:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:25:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:25:39,794 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-12-03 16:25:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:42,772 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-12-03 16:25:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:25:42,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-12-03 16:25:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:42,774 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:25:42,774 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:25:42,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2580 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2376, Invalid=5456, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:25:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:25:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 16:25:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:25:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 16:25:42,793 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-12-03 16:25:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:42,793 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 16:25:42,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:25:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 16:25:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:25:42,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:42,795 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 16:25:42,795 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:42,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 11 times [2018-12-03 16:25:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:42,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 16:25:42,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:42,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:42,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:42,943 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:42,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:42,943 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:25:42,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:42,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:43,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:25:43,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:43,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 16:25:43,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 16:25:43,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:25:43,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:43,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:25:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:25:43,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:43,266 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-12-03 16:25:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:43,484 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 16:25:43,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:25:43,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-03 16:25:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:43,486 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:25:43,486 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:25:43,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:25:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:25:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 16:25:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:25:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 16:25:43,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 16:25:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:43,506 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 16:25:43,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:25:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 16:25:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:25:43,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:43,508 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 16:25:43,508 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:43,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 12 times [2018-12-03 16:25:43,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:43,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:43,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:43,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:43,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 16:25:43,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:43,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:43,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:43,856 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:43,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:43,857 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:25:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:43,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:43,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:43,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:43,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 16:25:43,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 16:25:44,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:44,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:25:44,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:44,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:25:44,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:25:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:25:44,173 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-12-03 16:25:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:44,353 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 16:25:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:25:44,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-03 16:25:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:44,355 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:25:44,355 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:25:44,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:25:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:25:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 16:25:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:25:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 16:25:44,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 16:25:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:44,379 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 16:25:44,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:25:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 16:25:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:25:44,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:44,383 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 16:25:44,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:44,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 13 times [2018-12-03 16:25:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:44,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:44,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 16:25:44,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:44,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:44,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:44,677 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:44,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:44,677 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:25:44,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:44,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:44,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 16:25:44,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 16:25:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:25:45,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:45,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:25:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:25:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:25:45,402 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-12-03 16:25:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:45,592 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 16:25:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:25:45,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-12-03 16:25:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:45,594 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:25:45,596 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:25:45,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:25:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:25:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 16:25:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:25:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 16:25:45,647 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 16:25:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:45,648 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 16:25:45,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:25:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 16:25:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:25:45,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:45,650 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 16:25:45,650 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:45,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 14 times [2018-12-03 16:25:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:45,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:45,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:45,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:45,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 16:25:46,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:46,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:46,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:46,134 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:46,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:46,134 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:25:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:46,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:46,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 16:25:46,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:46,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 16:25:46,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 16:25:46,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:46,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:25:46,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:25:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:25:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:25:46,531 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-12-03 16:25:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:46,687 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-12-03 16:25:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:25:46,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-12-03 16:25:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:46,688 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:25:46,688 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:25:46,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:25:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:25:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-12-03 16:25:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:25:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-03 16:25:46,711 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-12-03 16:25:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:46,711 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-03 16:25:46,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:25:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-03 16:25:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:25:46,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:46,713 INFO L402 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-12-03 16:25:46,713 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:46,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 15 times [2018-12-03 16:25:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:46,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:46,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 16:25:47,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:47,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:47,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:47,546 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:47,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:47,546 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:25:47,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:47,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:47,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:47,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:47,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 16:25:47,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 16:25:47,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:47,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:25:47,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:47,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:25:47,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:25:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:25:47,915 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-12-03 16:25:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,136 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-12-03 16:25:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:25:48,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-12-03 16:25:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,137 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:25:48,137 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:25:48,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:25:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:25:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-12-03 16:25:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:25:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-12-03 16:25:48,160 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-12-03 16:25:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,160 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-12-03 16:25:48,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:25:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-12-03 16:25:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:25:48,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,161 INFO L402 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-12-03 16:25:48,162 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 16 times [2018-12-03 16:25:48,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:48,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:25:48,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:48,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:48,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:48,460 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:48,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:48,460 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:25:48,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:48,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:48,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:25:48,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 16:25:48,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:48,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:25:48,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:48,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:25:48,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:25:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:25:48,986 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-12-03 16:25:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:49,227 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-12-03 16:25:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:25:49,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-12-03 16:25:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:49,228 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:25:49,228 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:25:49,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 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:25:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:25:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-12-03 16:25:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:25:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-12-03 16:25:49,255 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-12-03 16:25:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:49,256 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-12-03 16:25:49,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:25:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-12-03 16:25:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:25:49,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:49,257 INFO L402 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-12-03 16:25:49,258 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:49,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 17 times [2018-12-03 16:25:49,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:49,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 16:25:49,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:49,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:49,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:49,733 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,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:49,733 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:25:49,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:49,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:49,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 16:25:49,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:49,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 16:25:49,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 16:25:50,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:50,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:25:50,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:50,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:25:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:25:50,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:25:50,353 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-12-03 16:25:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:50,455 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-12-03 16:25:50,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:25:50,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-12-03 16:25:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:50,457 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:25:50,457 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:25:50,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:25:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:25:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-12-03 16:25:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 16:25:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-12-03 16:25:50,492 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-12-03 16:25:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:50,493 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-12-03 16:25:50,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:25:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-12-03 16:25:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 16:25:50,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:50,495 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-12-03 16:25:50,495 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:50,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 18 times [2018-12-03 16:25:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:50,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:50,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 16:25:51,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:51,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:51,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:51,311 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:51,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:51,311 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:25:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:51,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:51,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:51,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:51,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 16:25:51,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 16:25:51,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:51,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:25:51,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:51,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:25:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:25:51,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:25:51,834 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-12-03 16:25:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:51,926 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-12-03 16:25:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:25:51,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-12-03 16:25:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:51,930 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:25:51,930 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 16:25:51,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:25:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 16:25:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-12-03 16:25:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 16:25:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-12-03 16:25:51,962 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-12-03 16:25:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:51,962 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-12-03 16:25:51,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:25:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-12-03 16:25:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 16:25:51,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:51,963 INFO L402 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-12-03 16:25:51,963 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:51,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:51,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 19 times [2018-12-03 16:25:51,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:51,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:51,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:51,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 16:25:52,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:52,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:52,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:52,380 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:52,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:52,380 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:25:52,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:52,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:52,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 16:25:52,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 16:25:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:52,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:25:52,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:52,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:25:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:25:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:25:52,914 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-12-03 16:25:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:53,009 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-12-03 16:25:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:25:53,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-12-03 16:25:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:53,011 INFO L225 Difference]: With dead ends: 209 [2018-12-03 16:25:53,011 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 16:25:53,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 349 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:25:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 16:25:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-12-03 16:25:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:25:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-12-03 16:25:53,051 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-12-03 16:25:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:53,052 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-12-03 16:25:53,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:25:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-12-03 16:25:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 16:25:53,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:53,053 INFO L402 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-12-03 16:25:53,053 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:53,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 20 times [2018-12-03 16:25:53,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 16:25:53,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:53,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:53,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:53,901 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,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:53,901 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:25:53,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:53,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:54,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 97 check-sat command(s) [2018-12-03 16:25:54,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 16:25:54,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 16:25:54,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:54,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:25:54,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:54,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:25:54,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:25:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:25:54,658 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-12-03 16:25:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:54,787 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-12-03 16:25:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:25:54,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-12-03 16:25:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:54,791 INFO L225 Difference]: With dead ends: 221 [2018-12-03 16:25:54,792 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 16:25:54,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:25:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 16:25:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-12-03 16:25:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 16:25:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-12-03 16:25:54,832 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-12-03 16:25:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:54,832 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-12-03 16:25:54,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:25:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-12-03 16:25:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 16:25:54,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:54,833 INFO L402 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-12-03 16:25:54,833 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:54,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:54,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 21 times [2018-12-03 16:25:54,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:54,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:54,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:54,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 16:25:55,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:55,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:55,952 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:55,952 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:55,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:55,952 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:25:55,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:55,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:56,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:56,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:56,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 16:25:56,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 16:25:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:56,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:25:56,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:56,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:25:56,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:25:56,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:25:56,597 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-12-03 16:25:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:56,736 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-03 16:25:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:25:56,737 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-12-03 16:25:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:56,738 INFO L225 Difference]: With dead ends: 233 [2018-12-03 16:25:56,738 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 16:25:56,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:25:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 16:25:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-12-03 16:25:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 16:25:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-12-03 16:25:56,785 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-12-03 16:25:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:56,785 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-12-03 16:25:56,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:25:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-12-03 16:25:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 16:25:56,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:56,786 INFO L402 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-12-03 16:25:56,786 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:56,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 22 times [2018-12-03 16:25:56,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:56,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:56,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:56,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:25:57,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:57,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:57,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:57,174 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,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:57,174 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:25:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:57,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:57,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:25:57,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:25:57,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:57,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:25:57,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:57,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:25:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:25:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:25:57,954 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-12-03 16:25:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:58,104 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-12-03 16:25:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:25:58,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-12-03 16:25:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:58,107 INFO L225 Difference]: With dead ends: 245 [2018-12-03 16:25:58,107 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 16:25:58,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:25:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 16:25:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-12-03 16:25:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 16:25:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-03 16:25:58,173 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-12-03 16:25:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:58,174 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-03 16:25:58,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:25:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-03 16:25:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 16:25:58,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:58,177 INFO L402 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-12-03 16:25:58,177 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:58,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 23 times [2018-12-03 16:25:58,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:58,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 16:25:58,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:58,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:58,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:58,569 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:58,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:58,569 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:25:58,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:58,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:58,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) [2018-12-03 16:25:58,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:58,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 16:25:58,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 16:25:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:25:59,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:59,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:25:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:25:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:25:59,462 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-12-03 16:25:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:59,639 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-12-03 16:25:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:25:59,639 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-12-03 16:25:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:59,640 INFO L225 Difference]: With dead ends: 257 [2018-12-03 16:25:59,641 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 16:25:59,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:25:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 16:25:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-12-03 16:25:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-03 16:25:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-12-03 16:25:59,701 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-12-03 16:25:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:59,701 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-12-03 16:25:59,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:25:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-12-03 16:25:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 16:25:59,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:59,703 INFO L402 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-12-03 16:25:59,703 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:59,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:59,704 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 24 times [2018-12-03 16:25:59,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 16:26:01,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:01,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:01,131 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,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,131 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:26:01,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:01,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:01,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:01,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:01,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 16:26:01,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 16:26:02,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:02,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:26:02,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:02,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:26:02,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:26:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:26:02,014 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-12-03 16:26:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:02,166 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-12-03 16:26:02,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:26:02,167 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-12-03 16:26:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:02,168 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:26:02,169 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 16:26:02,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:26:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 16:26:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-12-03 16:26:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-03 16:26:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-12-03 16:26:02,235 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-12-03 16:26:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:02,236 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-12-03 16:26:02,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:26:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-12-03 16:26:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-03 16:26:02,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:02,237 INFO L402 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-12-03 16:26:02,237 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:02,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 25 times [2018-12-03 16:26:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 16:26:02,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:02,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:02,654 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:02,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,654 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:26:02,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:02,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 16:26:02,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 16:26:03,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:03,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:26:03,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:03,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:26:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:26:03,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:26:03,570 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-12-03 16:26:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:03,806 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-12-03 16:26:03,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:26:03,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-12-03 16:26:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:03,808 INFO L225 Difference]: With dead ends: 281 [2018-12-03 16:26:03,808 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 16:26:03,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:26:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 16:26:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-03 16:26:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 16:26:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-12-03 16:26:03,904 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-12-03 16:26:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-12-03 16:26:03,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:26:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-12-03 16:26:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-03 16:26:03,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:03,907 INFO L402 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-12-03 16:26:03,907 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:03,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 26 times [2018-12-03 16:26:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 16:26:05,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:05,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:05,190 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:05,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,190 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:26:05,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:05,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:05,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 133 check-sat command(s) [2018-12-03 16:26:05,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:05,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 16:26:05,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 16:26:07,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:26:07,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:07,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:26:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:26:07,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:26:07,511 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-12-03 16:26:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:07,704 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-12-03 16:26:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:26:07,704 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-12-03 16:26:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:07,706 INFO L225 Difference]: With dead ends: 293 [2018-12-03 16:26:07,706 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 16:26:07,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:26:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 16:26:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-12-03 16:26:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 16:26:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-12-03 16:26:07,808 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-12-03 16:26:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:07,809 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-12-03 16:26:07,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:26:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-12-03 16:26:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-03 16:26:07,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:07,811 INFO L402 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-12-03 16:26:07,811 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:07,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 27 times [2018-12-03 16:26:07,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 16:26:08,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:08,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:08,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:08,712 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:08,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:08,712 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:26:08,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:08,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:08,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:08,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:08,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 16:26:08,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 16:26:10,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:10,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:26:10,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:10,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:26:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:26:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:26:10,344 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-12-03 16:26:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:10,564 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-12-03 16:26:10,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:26:10,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-12-03 16:26:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:10,566 INFO L225 Difference]: With dead ends: 305 [2018-12-03 16:26:10,566 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 16:26:10,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:26:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 16:26:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-12-03 16:26:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-03 16:26:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-12-03 16:26:10,659 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-12-03 16:26:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:10,659 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-12-03 16:26:10,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:26:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-12-03 16:26:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-03 16:26:10,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:10,661 INFO L402 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-12-03 16:26:10,661 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:10,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 28 times [2018-12-03 16:26:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:10,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:10,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 16:26:11,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:11,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:11,410 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,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,410 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:26:11,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:11,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 16:26:11,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 16:26:13,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:13,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:26:13,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:13,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:26:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:26:13,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:26:13,062 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-12-03 16:26:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:13,256 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-12-03 16:26:13,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:26:13,256 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-12-03 16:26:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:13,258 INFO L225 Difference]: With dead ends: 317 [2018-12-03 16:26:13,258 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 16:26:13,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:26:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 16:26:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-12-03 16:26:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-03 16:26:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-12-03 16:26:13,343 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-12-03 16:26:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:13,343 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-12-03 16:26:13,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:26:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-12-03 16:26:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-03 16:26:13,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:13,345 INFO L402 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-12-03 16:26:13,346 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:13,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 29 times [2018-12-03 16:26:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 16:26:14,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:14,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:14,690 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:14,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,690 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:26:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:14,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:15,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 146 check-sat command(s) [2018-12-03 16:26:15,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:15,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 16:26:15,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 16:26:16,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:16,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:26:16,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:16,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:26:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:26:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:26:16,204 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-12-03 16:26:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:16,459 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-12-03 16:26:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:26:16,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-12-03 16:26:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:16,460 INFO L225 Difference]: With dead ends: 329 [2018-12-03 16:26:16,460 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 16:26:16,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:26:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 16:26:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-12-03 16:26:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-03 16:26:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-12-03 16:26:16,567 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-12-03 16:26:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:16,568 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-12-03 16:26:16,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:26:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-12-03 16:26:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-03 16:26:16,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:16,570 INFO L402 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-12-03 16:26:16,570 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:16,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 30 times [2018-12-03 16:26:16,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:16,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:16,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 16:26:17,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:17,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:17,332 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,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,333 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:26:17,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:17,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:17,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:17,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:17,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 16:26:17,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 16:26:18,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:18,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:26:18,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:18,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:26:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:26:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:26:18,573 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-12-03 16:26:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:18,801 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-12-03 16:26:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:26:18,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-12-03 16:26:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:18,803 INFO L225 Difference]: With dead ends: 341 [2018-12-03 16:26:18,803 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 16:26:18,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:26:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 16:26:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-12-03 16:26:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-03 16:26:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-12-03 16:26:18,922 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-12-03 16:26:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:18,922 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-12-03 16:26:18,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:26:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-12-03 16:26:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-03 16:26:18,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:18,924 INFO L402 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-12-03 16:26:18,924 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:18,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 31 times [2018-12-03 16:26:18,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 16:26:19,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:19,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:19,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:19,561 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:19,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:19,561 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:26:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:19,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:19,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 16:26:19,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 16:26:21,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:21,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:26:21,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:21,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:26:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:26:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:26:21,302 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-12-03 16:26:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:21,556 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-12-03 16:26:21,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:26:21,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-12-03 16:26:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:21,558 INFO L225 Difference]: With dead ends: 353 [2018-12-03 16:26:21,558 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 16:26:21,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:26:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 16:26:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-12-03 16:26:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-03 16:26:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-12-03 16:26:21,668 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-12-03 16:26:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:21,669 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-12-03 16:26:21,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:26:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-12-03 16:26:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-03 16:26:21,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:21,671 INFO L402 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-12-03 16:26:21,671 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:21,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 32 times [2018-12-03 16:26:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:21,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:21,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 16:26:22,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:22,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:22,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:22,359 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:22,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:22,359 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:26:22,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:22,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:22,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 169 check-sat command(s) [2018-12-03 16:26:22,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:22,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 16:26:22,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 16:26:24,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:24,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:26:24,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:24,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:26:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:26:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:26:24,300 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-12-03 16:26:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:24,537 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-12-03 16:26:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:26:24,538 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-12-03 16:26:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:24,539 INFO L225 Difference]: With dead ends: 365 [2018-12-03 16:26:24,539 INFO L226 Difference]: Without dead ends: 363 [2018-12-03 16:26:24,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:26:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-03 16:26:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-12-03 16:26:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-03 16:26:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-12-03 16:26:24,684 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-12-03 16:26:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:24,684 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-12-03 16:26:24,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:26:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-12-03 16:26:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-12-03 16:26:24,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:24,686 INFO L402 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-12-03 16:26:24,687 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:24,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 33 times [2018-12-03 16:26:24,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:24,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:24,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 16:26:25,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:25,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:25,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:25,401 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:25,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:25,401 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:26:25,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:25,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:25,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:25,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:25,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 16:26:25,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 16:26:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:26:26,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:26,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:26:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:26:26,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:26:26,820 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-12-03 16:26:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:27,073 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-12-03 16:26:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:26:27,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-12-03 16:26:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:27,075 INFO L225 Difference]: With dead ends: 377 [2018-12-03 16:26:27,075 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 16:26:27,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:26:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 16:26:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-12-03 16:26:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 16:26:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-12-03 16:26:27,222 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-12-03 16:26:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:27,223 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-12-03 16:26:27,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:26:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-12-03 16:26:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-12-03 16:26:27,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:27,225 INFO L402 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-12-03 16:26:27,225 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 34 times [2018-12-03 16:26:27,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:27,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:27,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 16:26:28,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:28,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:28,342 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:28,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,342 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:26:28,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:28,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:28,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 16:26:28,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 16:26:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:26:30,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:30,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:26:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:26:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:30,355 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-12-03 16:26:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:30,763 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-12-03 16:26:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:26:30,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-12-03 16:26:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:30,765 INFO L225 Difference]: With dead ends: 389 [2018-12-03 16:26:30,765 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 16:26:30,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 16:26:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-12-03 16:26:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-03 16:26:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-12-03 16:26:30,890 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-12-03 16:26:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:30,890 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-12-03 16:26:30,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:26:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-12-03 16:26:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-03 16:26:30,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:30,892 INFO L402 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-12-03 16:26:30,892 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:30,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 35 times [2018-12-03 16:26:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 16:26:32,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:32,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:32,664 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:32,664 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:32,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:32,664 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:26:32,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:32,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:33,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 182 check-sat command(s) [2018-12-03 16:26:33,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:33,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 16:26:33,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 16:26:34,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:34,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:26:34,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:34,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:26:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:26:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:34,617 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-12-03 16:26:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:34,949 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-12-03 16:26:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:26:34,950 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-12-03 16:26:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:34,952 INFO L225 Difference]: With dead ends: 401 [2018-12-03 16:26:34,952 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 16:26:34,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 16:26:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-12-03 16:26:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-03 16:26:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-12-03 16:26:35,093 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-12-03 16:26:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:35,093 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-12-03 16:26:35,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:26:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-12-03 16:26:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-12-03 16:26:35,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:35,096 INFO L402 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-12-03 16:26:35,096 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:35,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 36 times [2018-12-03 16:26:35,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:35,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:35,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 16:26:36,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:36,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:36,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:36,235 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:36,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:36,235 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:26:36,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:36,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:36,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:36,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:36,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 16:26:36,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 16:26:38,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:38,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:26:38,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:38,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:26:38,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:26:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:38,060 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-12-03 16:26:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:38,380 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-12-03 16:26:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:26:38,381 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-12-03 16:26:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:38,382 INFO L225 Difference]: With dead ends: 413 [2018-12-03 16:26:38,383 INFO L226 Difference]: Without dead ends: 411 [2018-12-03 16:26:38,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-03 16:26:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-12-03 16:26:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-03 16:26:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-12-03 16:26:38,540 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-12-03 16:26:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:38,541 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-12-03 16:26:38,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:26:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-12-03 16:26:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-12-03 16:26:38,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:38,543 INFO L402 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-12-03 16:26:38,544 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:38,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 37 times [2018-12-03 16:26:38,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 16:26:39,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:39,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:39,312 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:39,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,312 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:26:39,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:39,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:39,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 16:26:39,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 16:26:41,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:41,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:26:41,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:41,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:26:41,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:26:41,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:41,466 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-12-03 16:26:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:41,788 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-12-03 16:26:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:26:41,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-12-03 16:26:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:41,790 INFO L225 Difference]: With dead ends: 425 [2018-12-03 16:26:41,790 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:26:41,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:26:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-12-03 16:26:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 16:26:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-12-03 16:26:41,961 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-12-03 16:26:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:41,961 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-12-03 16:26:41,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:26:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-12-03 16:26:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-12-03 16:26:41,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:41,964 INFO L402 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-12-03 16:26:41,964 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:41,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 38 times [2018-12-03 16:26:41,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:41,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:41,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 16:26:42,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:42,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:42,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:42,782 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,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:42,782 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:26:42,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:42,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:43,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 205 check-sat command(s) [2018-12-03 16:26:43,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:43,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 16:26:43,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 16:26:45,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:45,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:26:45,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:45,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:26:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:26:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:45,103 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-12-03 16:26:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:45,454 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-12-03 16:26:45,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:26:45,454 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-12-03 16:26:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:45,456 INFO L225 Difference]: With dead ends: 437 [2018-12-03 16:26:45,456 INFO L226 Difference]: Without dead ends: 435 [2018-12-03 16:26:45,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-03 16:26:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-12-03 16:26:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-03 16:26:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-12-03 16:26:45,617 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-12-03 16:26:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:45,618 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-12-03 16:26:45,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:26:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-12-03 16:26:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-12-03 16:26:45,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:45,621 INFO L402 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-12-03 16:26:45,621 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:45,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 39 times [2018-12-03 16:26:45,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:45,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:45,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 16:26:46,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:46,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:46,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:46,700 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:46,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:46,700 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:26:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:46,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:46,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:46,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:46,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 16:26:47,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 16:26:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:48,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:26:48,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:48,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:26:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:26:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:48,853 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-12-03 16:26:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:49,205 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-12-03 16:26:49,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:26:49,205 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-12-03 16:26:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:49,207 INFO L225 Difference]: With dead ends: 449 [2018-12-03 16:26:49,207 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 16:26:49,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 16:26:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-12-03 16:26:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-12-03 16:26:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-12-03 16:26:49,362 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-12-03 16:26:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:49,362 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-12-03 16:26:49,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:26:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-12-03 16:26:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-12-03 16:26:49,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:49,365 INFO L402 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-12-03 16:26:49,365 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:49,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 40 times [2018-12-03 16:26:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:49,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:49,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 16:26:50,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:50,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:50,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:50,278 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:50,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:50,278 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:26:50,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:50,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:50,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 16:26:50,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 16:26:52,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:52,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:26:52,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:52,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:26:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:26:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:52,643 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-12-03 16:26:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:52,994 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-12-03 16:26:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:26:52,994 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-12-03 16:26:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:52,996 INFO L225 Difference]: With dead ends: 461 [2018-12-03 16:26:52,996 INFO L226 Difference]: Without dead ends: 459 [2018-12-03 16:26:52,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-03 16:26:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-12-03 16:26:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-03 16:26:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-12-03 16:26:53,207 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-12-03 16:26:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:53,208 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-12-03 16:26:53,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:26:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-12-03 16:26:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-03 16:26:53,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:53,210 INFO L402 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-12-03 16:26:53,210 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:53,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:53,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 41 times [2018-12-03 16:26:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:53,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:53,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:53,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:53,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 16:26:54,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:54,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:54,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:54,441 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,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:54,442 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:26:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:54,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:55,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 218 check-sat command(s) [2018-12-03 16:26:55,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:55,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 16:26:55,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 16:26:57,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:57,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:26:57,445 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:57,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:26:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:26:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:57,447 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-12-03 16:26:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:57,860 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-12-03 16:26:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:26:57,860 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-12-03 16:26:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:57,862 INFO L225 Difference]: With dead ends: 473 [2018-12-03 16:26:57,862 INFO L226 Difference]: Without dead ends: 471 [2018-12-03 16:26:57,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-03 16:26:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-12-03 16:26:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 16:26:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-12-03 16:26:58,064 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-12-03 16:26:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:58,065 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-12-03 16:26:58,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:26:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-12-03 16:26:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-12-03 16:26:58,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:58,068 INFO L402 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-12-03 16:26:58,068 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:58,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 42 times [2018-12-03 16:26:58,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 16:26:59,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:59,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:59,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:59,067 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:59,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:59,067 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:26:59,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:59,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:59,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:59,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:59,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 16:26:59,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 16:27:01,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:01,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:27:01,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:01,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:27:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:27:01,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:27:01,934 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-12-03 16:27:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:02,349 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-12-03 16:27:02,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:27:02,349 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-12-03 16:27:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:02,351 INFO L225 Difference]: With dead ends: 485 [2018-12-03 16:27:02,351 INFO L226 Difference]: Without dead ends: 483 [2018-12-03 16:27:02,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:27:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-03 16:27:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-12-03 16:27:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-03 16:27:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-12-03 16:27:02,550 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-12-03 16:27:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:02,550 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-12-03 16:27:02,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:27:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-12-03 16:27:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-12-03 16:27:02,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:02,552 INFO L402 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-12-03 16:27:02,553 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:02,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:02,553 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 43 times [2018-12-03 16:27:02,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:02,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:02,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:02,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:02,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 16:27:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:03,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:03,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:03,473 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:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:03,473 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:27:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:03,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:03,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 16:27:03,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 16:27:05,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:05,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:27:05,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:05,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:27:05,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:27:05,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:27:05,819 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-12-03 16:27:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:06,380 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-12-03 16:27:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:27:06,381 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-12-03 16:27:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:06,383 INFO L225 Difference]: With dead ends: 497 [2018-12-03 16:27:06,383 INFO L226 Difference]: Without dead ends: 495 [2018-12-03 16:27:06,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:27:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-12-03 16:27:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-12-03 16:27:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-03 16:27:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-12-03 16:27:06,601 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-12-03 16:27:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:06,602 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-12-03 16:27:06,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:27:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-12-03 16:27:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-12-03 16:27:06,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:06,604 INFO L402 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-12-03 16:27:06,604 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:06,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 44 times [2018-12-03 16:27:06,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:06,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:06,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 16:27:07,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:07,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:07,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:07,536 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:07,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:07,536 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:27:07,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:07,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:08,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 241 check-sat command(s) [2018-12-03 16:27:08,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:08,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 16:27:08,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 16:27:10,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:10,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:27:10,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:10,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:27:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:27:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:27:10,643 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-12-03 16:27:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:11,092 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-12-03 16:27:11,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:27:11,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-12-03 16:27:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:11,094 INFO L225 Difference]: With dead ends: 509 [2018-12-03 16:27:11,094 INFO L226 Difference]: Without dead ends: 507 [2018-12-03 16:27:11,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:27:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-03 16:27:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-12-03 16:27:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-03 16:27:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-12-03 16:27:11,310 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-12-03 16:27:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:11,310 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-12-03 16:27:11,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:27:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-12-03 16:27:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-12-03 16:27:11,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:11,312 INFO L402 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-12-03 16:27:11,313 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:11,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 45 times [2018-12-03 16:27:11,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 16:27:12,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:12,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:12,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:12,493 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:12,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:12,493 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:27:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:12,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:12,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:12,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:12,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 16:27:12,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 16:27:15,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:15,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:27:15,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:15,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:27:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:27:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:15,093 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-12-03 16:27:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:15,565 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-12-03 16:27:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:27:15,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-12-03 16:27:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:15,568 INFO L225 Difference]: With dead ends: 521 [2018-12-03 16:27:15,568 INFO L226 Difference]: Without dead ends: 519 [2018-12-03 16:27:15,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-03 16:27:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-12-03 16:27:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-12-03 16:27:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-12-03 16:27:15,798 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-12-03 16:27:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:15,798 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-12-03 16:27:15,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:27:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-12-03 16:27:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-12-03 16:27:15,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:15,801 INFO L402 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-12-03 16:27:15,801 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:15,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 46 times [2018-12-03 16:27:15,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:15,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:15,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 16:27:17,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:17,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:17,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:17,098 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:17,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:17,099 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:27:17,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:17,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:17,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 16:27:17,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 16:27:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:19,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:27:19,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:19,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:27:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:27:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:19,786 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-12-03 16:27:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:20,788 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-12-03 16:27:20,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:27:20,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-12-03 16:27:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:20,792 INFO L225 Difference]: With dead ends: 533 [2018-12-03 16:27:20,792 INFO L226 Difference]: Without dead ends: 531 [2018-12-03 16:27:20,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-03 16:27:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-12-03 16:27:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 16:27:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-12-03 16:27:21,130 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-12-03 16:27:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:21,130 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-12-03 16:27:21,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:27:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-12-03 16:27:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-12-03 16:27:21,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:21,133 INFO L402 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-12-03 16:27:21,134 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:21,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 47 times [2018-12-03 16:27:21,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:21,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 16:27:22,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:22,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:22,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:22,476 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:22,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:22,476 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:27:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:22,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:23,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 254 check-sat command(s) [2018-12-03 16:27:23,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:23,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 16:27:23,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 16:27:25,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:25,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:27:25,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:25,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:27:25,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:27:25,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:25,922 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-12-03 16:27:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:26,536 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-12-03 16:27:26,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:27:26,539 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-12-03 16:27:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:26,542 INFO L225 Difference]: With dead ends: 545 [2018-12-03 16:27:26,542 INFO L226 Difference]: Without dead ends: 543 [2018-12-03 16:27:26,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 993 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-03 16:27:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-12-03 16:27:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-03 16:27:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-12-03 16:27:26,856 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-12-03 16:27:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:26,857 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-12-03 16:27:26,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:27:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-12-03 16:27:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-12-03 16:27:26,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:26,859 INFO L402 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-12-03 16:27:26,859 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:26,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 48 times [2018-12-03 16:27:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:26,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:26,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 16:27:28,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:28,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:28,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:28,062 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:28,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:28,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 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:27:28,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:28,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:28,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:28,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:28,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 16:27:28,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 16:27:30,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:30,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:27:30,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:30,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:27:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:27:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:27:30,960 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-12-03 16:27:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:31,637 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-12-03 16:27:31,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:27:31,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-12-03 16:27:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:31,639 INFO L225 Difference]: With dead ends: 557 [2018-12-03 16:27:31,639 INFO L226 Difference]: Without dead ends: 555 [2018-12-03 16:27:31,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:27:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-12-03 16:27:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-12-03 16:27:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-03 16:27:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-12-03 16:27:31,921 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-12-03 16:27:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:31,921 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-12-03 16:27:31,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:27:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-12-03 16:27:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-12-03 16:27:31,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:31,924 INFO L402 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-12-03 16:27:31,924 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:31,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 49 times [2018-12-03 16:27:31,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:31,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:31,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 16:27:33,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:33,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:33,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:33,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:27:33,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:33,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 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:27:33,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:33,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:33,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 16:27:33,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 16:27:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:36,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:27:36,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:36,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:27:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:27:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:27:36,167 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-12-03 16:27:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:36,748 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-12-03 16:27:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:27:36,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-12-03 16:27:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:36,751 INFO L225 Difference]: With dead ends: 569 [2018-12-03 16:27:36,751 INFO L226 Difference]: Without dead ends: 567 [2018-12-03 16:27:36,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:27:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-12-03 16:27:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-12-03 16:27:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-03 16:27:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-12-03 16:27:37,022 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-12-03 16:27:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:37,023 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-12-03 16:27:37,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:27:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-12-03 16:27:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-12-03 16:27:37,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:37,027 INFO L402 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-12-03 16:27:37,027 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:37,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 50 times [2018-12-03 16:27:37,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:37,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:37,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 16:27:38,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:38,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:38,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:38,374 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:38,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:38,374 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:27:38,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:38,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:39,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 277 check-sat command(s) [2018-12-03 16:27:39,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:39,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 16:27:39,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 16:27:42,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:42,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:27:42,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:42,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:27:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:27:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:27:42,681 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-12-03 16:27:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:43,238 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-12-03 16:27:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:27:43,238 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-12-03 16:27:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:43,240 INFO L225 Difference]: With dead ends: 581 [2018-12-03 16:27:43,241 INFO L226 Difference]: Without dead ends: 579 [2018-12-03 16:27:43,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:27:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-03 16:27:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-12-03 16:27:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-03 16:27:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-12-03 16:27:43,553 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-12-03 16:27:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:43,554 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-12-03 16:27:43,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:27:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-12-03 16:27:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-12-03 16:27:43,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:43,556 INFO L402 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-12-03 16:27:43,557 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:43,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 51 times [2018-12-03 16:27:43,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:43,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:43,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 16:27:44,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:44,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:44,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:44,800 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:44,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:44,800 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:27:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:44,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:45,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:45,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:45,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 16:27:45,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 16:27:48,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:48,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:27:48,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:48,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:27:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:27:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:27:48,326 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-12-03 16:27:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:48,927 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-12-03 16:27:48,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:27:48,928 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-12-03 16:27:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:48,930 INFO L225 Difference]: With dead ends: 593 [2018-12-03 16:27:48,930 INFO L226 Difference]: Without dead ends: 591 [2018-12-03 16:27:48,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1085 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:27:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-12-03 16:27:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-12-03 16:27:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-03 16:27:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-12-03 16:27:49,220 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-12-03 16:27:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:49,220 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-12-03 16:27:49,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:27:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-12-03 16:27:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-12-03 16:27:49,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:49,223 INFO L402 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-12-03 16:27:49,223 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:49,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:49,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 52 times [2018-12-03 16:27:49,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:49,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:49,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:49,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:49,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 16:27:50,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:50,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:50,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:50,498 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:50,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:50,498 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:27:50,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:50,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:50,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 16:27:51,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 16:27:54,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:54,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:27:54,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:54,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:27:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:27:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:27:54,344 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-12-03 16:27:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:55,004 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-12-03 16:27:55,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:27:55,004 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-12-03 16:27:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:55,006 INFO L225 Difference]: With dead ends: 605 [2018-12-03 16:27:55,006 INFO L226 Difference]: Without dead ends: 603 [2018-12-03 16:27:55,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1108 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:27:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-03 16:27:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-12-03 16:27:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-03 16:27:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-12-03 16:27:55,308 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-12-03 16:27:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:55,308 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-12-03 16:27:55,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:27:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-12-03 16:27:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-12-03 16:27:55,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:55,311 INFO L402 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-12-03 16:27:55,311 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:55,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 53 times [2018-12-03 16:27:55,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:55,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:55,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 16:27:56,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:56,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:56,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:56,640 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:56,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:56,640 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:27:56,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:56,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:58,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 290 check-sat command(s) [2018-12-03 16:27:58,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:58,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 16:27:58,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 16:28:01,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:01,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:28:01,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:01,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:28:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:28:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:28:01,216 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-12-03 16:28:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:01,921 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-12-03 16:28:01,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:28:01,921 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-12-03 16:28:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:01,923 INFO L225 Difference]: With dead ends: 617 [2018-12-03 16:28:01,923 INFO L226 Difference]: Without dead ends: 615 [2018-12-03 16:28:01,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:28:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-12-03 16:28:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-12-03 16:28:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-03 16:28:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-12-03 16:28:02,245 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-12-03 16:28:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:02,245 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-12-03 16:28:02,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:28:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-12-03 16:28:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-12-03 16:28:02,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:02,248 INFO L402 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-12-03 16:28:02,248 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:02,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 54 times [2018-12-03 16:28:02,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:02,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:02,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:02,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:02,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 16:28:03,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:03,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:03,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:03,855 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:03,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:03,855 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:28:03,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:03,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:04,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:04,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:04,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 16:28:04,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 16:28:07,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:07,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:28:07,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:07,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:28:07,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:28:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:28:07,561 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-12-03 16:28:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:08,214 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-12-03 16:28:08,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:28:08,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-12-03 16:28:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:08,217 INFO L225 Difference]: With dead ends: 629 [2018-12-03 16:28:08,217 INFO L226 Difference]: Without dead ends: 627 [2018-12-03 16:28:08,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1256 GetRequests, 1154 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:28:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-12-03 16:28:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-12-03 16:28:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-03 16:28:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-12-03 16:28:08,556 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-12-03 16:28:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:08,556 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-12-03 16:28:08,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:28:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-12-03 16:28:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-12-03 16:28:08,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:08,559 INFO L402 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-12-03 16:28:08,559 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:08,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 55 times [2018-12-03 16:28:08,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:08,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:08,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 16:28:10,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:10,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:10,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:10,261 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:10,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:10,261 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:28:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:10,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:10,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 16:28:10,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 16:28:14,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:14,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:28:14,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:14,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:28:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:28:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:28:14,332 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-12-03 16:28:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:15,007 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-12-03 16:28:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:28:15,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-12-03 16:28:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:15,010 INFO L225 Difference]: With dead ends: 641 [2018-12-03 16:28:15,010 INFO L226 Difference]: Without dead ends: 639 [2018-12-03 16:28:15,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1281 GetRequests, 1177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:28:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-03 16:28:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-12-03 16:28:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-12-03 16:28:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-12-03 16:28:15,390 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-12-03 16:28:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:15,391 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-12-03 16:28:15,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:28:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-12-03 16:28:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-12-03 16:28:15,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:15,394 INFO L402 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-12-03 16:28:15,394 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:15,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 56 times [2018-12-03 16:28:15,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:15,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:15,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:15,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:15,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 16:28:16,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:16,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:16,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:16,894 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:16,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:16,894 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:28:16,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:16,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:18,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 313 check-sat command(s) [2018-12-03 16:28:18,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:18,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 16:28:18,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 16:28:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:28:21,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:21,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:28:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:28:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:28:21,946 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-12-03 16:28:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:22,649 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-12-03 16:28:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:28:22,649 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-12-03 16:28:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:22,652 INFO L225 Difference]: With dead ends: 653 [2018-12-03 16:28:22,652 INFO L226 Difference]: Without dead ends: 651 [2018-12-03 16:28:22,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:28:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-03 16:28:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-12-03 16:28:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-03 16:28:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-12-03 16:28:23,018 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-12-03 16:28:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:23,019 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-12-03 16:28:23,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:28:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-12-03 16:28:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-12-03 16:28:23,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:23,022 INFO L402 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-12-03 16:28:23,022 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:23,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 57 times [2018-12-03 16:28:23,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:23,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:23,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 16:28:24,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:24,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:24,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:24,717 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:24,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:24,717 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:28:24,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:24,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:25,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:25,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:25,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 16:28:25,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 16:28:29,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:29,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:28:29,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:29,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:28:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:28:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:28:29,065 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-12-03 16:28:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:29,837 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-12-03 16:28:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:28:29,837 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-12-03 16:28:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:29,840 INFO L225 Difference]: With dead ends: 665 [2018-12-03 16:28:29,840 INFO L226 Difference]: Without dead ends: 663 [2018-12-03 16:28:29,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:28:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-12-03 16:28:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-12-03 16:28:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-03 16:28:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-12-03 16:28:30,245 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-12-03 16:28:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:30,245 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-12-03 16:28:30,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:28:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-12-03 16:28:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-12-03 16:28:30,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:30,248 INFO L402 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-12-03 16:28:30,249 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:30,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 58 times [2018-12-03 16:28:30,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:30,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:30,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 16:28:31,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:31,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:31,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:31,730 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:31,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:31,730 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:28:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:31,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:32,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 16:28:32,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 16:28:36,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:36,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:28:36,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:36,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:28:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:28:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:28:36,191 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-12-03 16:28:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:36,977 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-12-03 16:28:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:28:36,978 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-12-03 16:28:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:36,980 INFO L225 Difference]: With dead ends: 677 [2018-12-03 16:28:36,980 INFO L226 Difference]: Without dead ends: 675 [2018-12-03 16:28:36,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 1246 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:28:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-12-03 16:28:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-12-03 16:28:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-03 16:28:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-12-03 16:28:37,417 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-12-03 16:28:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-12-03 16:28:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:28:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-12-03 16:28:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-12-03 16:28:37,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:37,421 INFO L402 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-12-03 16:28:37,421 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:37,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 59 times [2018-12-03 16:28:37,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:37,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:37,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 16:28:39,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:39,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:39,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:39,221 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,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:39,221 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:28:39,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:39,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:40,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 326 check-sat command(s) [2018-12-03 16:28:40,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:40,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 16:28:41,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 16:28:45,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:45,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:28:45,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:45,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:28:45,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:28:45,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:28:45,149 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-12-03 16:28:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:45,918 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-12-03 16:28:45,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:28:45,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-12-03 16:28:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:45,920 INFO L225 Difference]: With dead ends: 689 [2018-12-03 16:28:45,920 INFO L226 Difference]: Without dead ends: 687 [2018-12-03 16:28:45,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1269 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:28:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-03 16:28:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-12-03 16:28:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-12-03 16:28:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-12-03 16:28:46,410 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-12-03 16:28:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:46,410 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-12-03 16:28:46,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:28:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-12-03 16:28:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-12-03 16:28:46,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:46,414 INFO L402 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-12-03 16:28:46,414 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:46,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 60 times [2018-12-03 16:28:46,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:46,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:46,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 16:28:48,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:48,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:48,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:48,058 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:48,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:48,058 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:28:48,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:48,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:48,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:48,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:48,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 16:28:48,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 16:28:52,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:52,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:28:52,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:52,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:28:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:28:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:28:52,794 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-12-03 16:28:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:53,646 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-12-03 16:28:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:28:53,646 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-12-03 16:28:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:53,648 INFO L225 Difference]: With dead ends: 701 [2018-12-03 16:28:53,648 INFO L226 Difference]: Without dead ends: 699 [2018-12-03 16:28:53,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1292 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:28:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-03 16:28:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-12-03 16:28:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-03 16:28:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-12-03 16:28:54,087 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-12-03 16:28:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:54,087 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-12-03 16:28:54,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:28:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-12-03 16:28:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-12-03 16:28:54,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:54,091 INFO L402 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-12-03 16:28:54,091 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:54,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 61 times [2018-12-03 16:28:54,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:54,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:54,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:54,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:54,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 16:28:55,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:55,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:55,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:55,797 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:55,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:55,797 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:28:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:55,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:56,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 16:28:56,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 16:29:00,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:00,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:29:00,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:00,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:29:00,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:29:00,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:29:00,726 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-12-03 16:29:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:01,554 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-12-03 16:29:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:29:01,554 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-12-03 16:29:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:01,556 INFO L225 Difference]: With dead ends: 713 [2018-12-03 16:29:01,557 INFO L226 Difference]: Without dead ends: 711 [2018-12-03 16:29:01,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1315 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:29:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-12-03 16:29:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-12-03 16:29:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 16:29:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-12-03 16:29:02,034 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-12-03 16:29:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:02,034 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-12-03 16:29:02,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:29:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-12-03 16:29:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-12-03 16:29:02,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:02,038 INFO L402 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-12-03 16:29:02,038 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:02,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 62 times [2018-12-03 16:29:02,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:02,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:02,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 16:29:03,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:03,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:03,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:03,754 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:03,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:03,754 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:29:03,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:03,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:05,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 349 check-sat command(s) [2018-12-03 16:29:05,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:05,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 16:29:05,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 16:29:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:29:10,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:10,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:29:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:29:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:29:10,290 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-12-03 16:29:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:11,122 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-12-03 16:29:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:29:11,123 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-12-03 16:29:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:11,125 INFO L225 Difference]: With dead ends: 725 [2018-12-03 16:29:11,125 INFO L226 Difference]: Without dead ends: 723 [2018-12-03 16:29:11,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1456 GetRequests, 1338 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:29:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-03 16:29:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-12-03 16:29:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-03 16:29:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-12-03 16:29:11,585 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-12-03 16:29:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:11,586 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-12-03 16:29:11,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:29:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-12-03 16:29:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-12-03 16:29:11,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:11,589 INFO L402 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-12-03 16:29:11,590 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:11,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 63 times [2018-12-03 16:29:11,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:11,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:11,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 16:29:13,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:13,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:13,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:13,336 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:13,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:13,336 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:29:13,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:13,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:13,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:13,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:13,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 16:29:14,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 16:29:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:18,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:29:18,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:18,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:29:18,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:29:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:29:18,590 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-12-03 16:29:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:19,444 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-12-03 16:29:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:29:19,445 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-12-03 16:29:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:19,447 INFO L225 Difference]: With dead ends: 737 [2018-12-03 16:29:19,447 INFO L226 Difference]: Without dead ends: 735 [2018-12-03 16:29:19,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1361 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:29:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-03 16:29:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-12-03 16:29:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-03 16:29:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-12-03 16:29:19,922 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-12-03 16:29:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:19,922 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-12-03 16:29:19,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:29:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-12-03 16:29:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-12-03 16:29:19,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:19,926 INFO L402 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-12-03 16:29:19,926 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:19,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 64 times [2018-12-03 16:29:19,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:19,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:19,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:19,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 16:29:21,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:21,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:21,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:21,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:29:21,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:21,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 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:29:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:21,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:22,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 16:29:22,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 16:29:27,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:27,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:29:27,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:27,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:29:27,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:29:27,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:29:27,171 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-12-03 16:29:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:28,100 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-12-03 16:29:28,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:29:28,100 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-12-03 16:29:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:28,103 INFO L225 Difference]: With dead ends: 749 [2018-12-03 16:29:28,103 INFO L226 Difference]: Without dead ends: 747 [2018-12-03 16:29:28,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1384 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:29:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-03 16:29:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-12-03 16:29:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-03 16:29:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-12-03 16:29:28,606 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-12-03 16:29:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:28,606 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-12-03 16:29:28,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:29:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-12-03 16:29:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-12-03 16:29:28,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:28,610 INFO L402 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-12-03 16:29:28,610 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:28,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 65 times [2018-12-03 16:29:28,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:28,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:28,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 16:29:30,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:30,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:30,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:30,895 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:30,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:30,896 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:29:30,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:30,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:32,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 362 check-sat command(s) [2018-12-03 16:29:32,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:32,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 16:29:33,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 16:29:37,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:37,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:29:37,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:37,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:29:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:29:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:29:37,936 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-12-03 16:29:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:39,311 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-12-03 16:29:39,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:29:39,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-12-03 16:29:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:39,314 INFO L225 Difference]: With dead ends: 761 [2018-12-03 16:29:39,314 INFO L226 Difference]: Without dead ends: 759 [2018-12-03 16:29:39,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1531 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:29:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-03 16:29:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-12-03 16:29:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-12-03 16:29:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-12-03 16:29:39,845 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-12-03 16:29:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:39,845 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-12-03 16:29:39,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:29:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-12-03 16:29:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-12-03 16:29:39,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:39,849 INFO L402 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-12-03 16:29:39,849 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:39,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 66 times [2018-12-03 16:29:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:39,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:39,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 16:29:41,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:41,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:41,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:41,844 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:41,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:41,845 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:29:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:41,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:42,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:42,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:42,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 16:29:42,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 16:29:47,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:47,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:29:47,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:47,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:29:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:29:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:29:47,470 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-12-03 16:29:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:48,418 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-12-03 16:29:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:29:48,419 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-12-03 16:29:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:48,421 INFO L225 Difference]: With dead ends: 773 [2018-12-03 16:29:48,421 INFO L226 Difference]: Without dead ends: 771 [2018-12-03 16:29:48,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1556 GetRequests, 1430 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:29:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-03 16:29:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-12-03 16:29:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-12-03 16:29:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-12-03 16:29:48,994 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-12-03 16:29:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:48,994 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-12-03 16:29:48,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:29:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-12-03 16:29:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-12-03 16:29:48,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:48,998 INFO L402 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-12-03 16:29:48,998 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:48,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 67 times [2018-12-03 16:29:48,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:48,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:48,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:48,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:48,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 16:29:51,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:51,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:51,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:51,898 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:51,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:51,898 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:29:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:51,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:52,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 16:29:52,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 16:29:57,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:57,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:29:57,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:57,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:29:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:29:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:29:57,635 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-12-03 16:29:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:58,589 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-12-03 16:29:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:29:58,589 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-12-03 16:29:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:58,592 INFO L225 Difference]: With dead ends: 785 [2018-12-03 16:29:58,592 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 16:29:58,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1581 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:29:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 16:29:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-12-03 16:29:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 16:29:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-12-03 16:29:59,143 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-12-03 16:29:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:59,143 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-12-03 16:29:59,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:29:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-12-03 16:29:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-12-03 16:29:59,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:59,147 INFO L402 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-12-03 16:29:59,148 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:59,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 68 times [2018-12-03 16:29:59,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:59,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 16:30:01,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:01,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:01,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:01,544 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:01,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:01,544 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:30:01,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:01,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:03,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 385 check-sat command(s) [2018-12-03 16:30:03,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:03,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 16:30:04,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 16:30:09,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:09,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:30:09,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:09,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:30:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:30:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:30:09,490 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-12-03 16:30:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:10,511 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-12-03 16:30:10,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:30:10,511 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-12-03 16:30:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:10,514 INFO L225 Difference]: With dead ends: 797 [2018-12-03 16:30:10,514 INFO L226 Difference]: Without dead ends: 795 [2018-12-03 16:30:10,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1606 GetRequests, 1476 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:30:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-12-03 16:30:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-12-03 16:30:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-12-03 16:30:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-12-03 16:30:11,140 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-12-03 16:30:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:11,140 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-12-03 16:30:11,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:30:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-12-03 16:30:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-12-03 16:30:11,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:11,145 INFO L402 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-12-03 16:30:11,145 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:11,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 69 times [2018-12-03 16:30:11,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:11,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:11,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 16:30:13,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:13,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:13,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:13,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:30:13,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:13,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 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:30:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:13,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:13,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:13,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:13,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 16:30:14,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 16:30:19,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:30:19,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:19,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:30:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:30:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:30:19,514 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-12-03 16:30:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:20,564 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-12-03 16:30:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:30:20,565 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-12-03 16:30:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:20,568 INFO L225 Difference]: With dead ends: 809 [2018-12-03 16:30:20,568 INFO L226 Difference]: Without dead ends: 807 [2018-12-03 16:30:20,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1631 GetRequests, 1499 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:30:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-03 16:30:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-12-03 16:30:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-12-03 16:30:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-12-03 16:30:21,208 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-12-03 16:30:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:21,208 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-12-03 16:30:21,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:30:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-12-03 16:30:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-12-03 16:30:21,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:21,213 INFO L402 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-12-03 16:30:21,213 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:21,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 70 times [2018-12-03 16:30:21,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:21,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:21,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 16:30:23,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:23,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:23,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:23,406 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:23,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:23,407 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:30:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:23,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:23,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 16:30:24,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 16:30:29,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:30:29,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:29,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:30:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:30:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:30:29,606 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-12-03 16:30:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:30,696 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-12-03 16:30:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:30:30,697 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-12-03 16:30:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:30,700 INFO L225 Difference]: With dead ends: 821 [2018-12-03 16:30:30,700 INFO L226 Difference]: Without dead ends: 819 [2018-12-03 16:30:30,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1656 GetRequests, 1522 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:30:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-03 16:30:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-12-03 16:30:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-03 16:30:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-12-03 16:30:31,399 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-12-03 16:30:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:31,399 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-12-03 16:30:31,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:30:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-12-03 16:30:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-12-03 16:30:31,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:31,404 INFO L402 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-12-03 16:30:31,404 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:31,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 71 times [2018-12-03 16:30:31,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:31,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:31,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 16:30:33,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:33,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:33,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:33,617 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:33,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:33,617 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:30:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:33,625 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:35,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 398 check-sat command(s) [2018-12-03 16:30:35,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:36,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 16:30:36,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 16:30:41,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:41,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:30:41,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:41,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:30:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:30:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:30:41,761 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-12-03 16:30:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:42,886 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-12-03 16:30:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:30:42,887 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-12-03 16:30:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:42,890 INFO L225 Difference]: With dead ends: 833 [2018-12-03 16:30:42,890 INFO L226 Difference]: Without dead ends: 831 [2018-12-03 16:30:42,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1681 GetRequests, 1545 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:30:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-03 16:30:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-12-03 16:30:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-12-03 16:30:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-12-03 16:30:43,581 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-12-03 16:30:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:43,582 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-12-03 16:30:43,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:30:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-12-03 16:30:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-12-03 16:30:43,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:43,586 INFO L402 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-12-03 16:30:43,586 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:43,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 72 times [2018-12-03 16:30:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:43,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:43,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:43,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 16:30:45,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:45,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:45,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:45,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:30:45,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:45,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 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:30:45,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:45,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:46,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:46,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:46,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 16:30:46,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 16:30:52,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:52,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:30:52,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:52,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:30:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:30:52,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:30:52,745 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-12-03 16:30:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:54,125 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-12-03 16:30:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:30:54,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-12-03 16:30:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:54,128 INFO L225 Difference]: With dead ends: 845 [2018-12-03 16:30:54,129 INFO L226 Difference]: Without dead ends: 843 [2018-12-03 16:30:54,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:30:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-12-03 16:30:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-12-03 16:30:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-12-03 16:30:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-12-03 16:30:54,794 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-12-03 16:30:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:54,794 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-12-03 16:30:54,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:30:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-12-03 16:30:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-12-03 16:30:54,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:54,799 INFO L402 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-12-03 16:30:54,799 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:54,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 73 times [2018-12-03 16:30:54,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:54,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:54,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 16:30:57,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:57,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:57,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:57,368 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:57,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:57,368 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:30:57,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:57,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:57,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 16:30:58,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 16:31:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:31:04,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:04,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:31:04,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:31:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:31:04,328 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-12-03 16:31:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:05,528 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-12-03 16:31:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:31:05,528 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-12-03 16:31:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:05,531 INFO L225 Difference]: With dead ends: 857 [2018-12-03 16:31:05,531 INFO L226 Difference]: Without dead ends: 855 [2018-12-03 16:31:05,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1591 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:31:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-03 16:31:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-12-03 16:31:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-03 16:31:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-12-03 16:31:06,272 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-12-03 16:31:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:06,273 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-12-03 16:31:06,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:31:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-12-03 16:31:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-12-03 16:31:06,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:06,279 INFO L402 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-12-03 16:31:06,280 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:06,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 74 times [2018-12-03 16:31:06,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:06,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:06,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:06,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:06,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 16:31:08,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:08,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:08,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:08,944 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:08,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:08,944 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:31:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:08,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:11,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 421 check-sat command(s) [2018-12-03 16:31:11,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:11,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 16:31:12,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 16:31:18,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:18,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:31:18,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:18,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:31:18,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:31:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:31:18,360 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-12-03 16:31:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:19,590 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-12-03 16:31:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:31:19,590 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-12-03 16:31:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:19,593 INFO L225 Difference]: With dead ends: 869 [2018-12-03 16:31:19,593 INFO L226 Difference]: Without dead ends: 867 [2018-12-03 16:31:19,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1614 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:31:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-03 16:31:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-12-03 16:31:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-03 16:31:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-12-03 16:31:20,332 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-12-03 16:31:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:20,332 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-12-03 16:31:20,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:31:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-12-03 16:31:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-12-03 16:31:20,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:20,337 INFO L402 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-12-03 16:31:20,338 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:20,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 75 times [2018-12-03 16:31:20,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:20,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:20,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 16:31:23,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:23,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:23,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:23,030 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:23,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:23,030 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:31:23,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:23,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:23,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:23,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:23,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 16:31:24,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 16:31:30,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:30,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:31:30,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:30,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:31:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:31:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:31:30,359 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-12-03 16:31:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:31,629 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-12-03 16:31:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:31:31,629 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-12-03 16:31:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:31,631 INFO L225 Difference]: With dead ends: 881 [2018-12-03 16:31:31,631 INFO L226 Difference]: Without dead ends: 879 [2018-12-03 16:31:31,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1637 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:31:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-03 16:31:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-12-03 16:31:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-12-03 16:31:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-12-03 16:31:32,387 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-12-03 16:31:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:32,388 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-12-03 16:31:32,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:31:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-12-03 16:31:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-12-03 16:31:32,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:32,392 INFO L402 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-12-03 16:31:32,392 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:32,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 76 times [2018-12-03 16:31:32,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:32,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:32,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:32,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:32,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 16:31:35,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:35,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:35,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:35,151 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:35,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:35,152 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:31:35,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:35,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:35,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 16:31:36,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 16:31:42,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:42,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:31:42,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:42,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:31:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:31:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:31:42,700 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-12-03 16:31:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:43,984 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-12-03 16:31:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:31:43,984 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-12-03 16:31:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:43,986 INFO L225 Difference]: With dead ends: 893 [2018-12-03 16:31:43,986 INFO L226 Difference]: Without dead ends: 891 [2018-12-03 16:31:43,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1806 GetRequests, 1660 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:31:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-03 16:31:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-12-03 16:31:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-12-03 16:31:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-12-03 16:31:44,789 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-12-03 16:31:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-12-03 16:31:44,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:31:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-12-03 16:31:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-12-03 16:31:44,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:44,795 INFO L402 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-12-03 16:31:44,795 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:44,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 77 times [2018-12-03 16:31:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:44,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:44,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 16:31:47,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:47,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:47,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:47,459 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:47,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:47,459 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:31:47,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:47,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:50,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 434 check-sat command(s) [2018-12-03 16:31:50,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:50,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 16:31:50,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 16:31:57,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:57,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:31:57,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:57,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:31:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:31:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:31:57,565 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-12-03 16:31:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:58,845 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-12-03 16:31:58,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:31:58,853 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-12-03 16:31:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:58,855 INFO L225 Difference]: With dead ends: 905 [2018-12-03 16:31:58,855 INFO L226 Difference]: Without dead ends: 903 [2018-12-03 16:31:58,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1831 GetRequests, 1683 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:31:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-03 16:31:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-12-03 16:31:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-03 16:31:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-12-03 16:31:59,629 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-12-03 16:31:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:59,629 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-12-03 16:31:59,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:31:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-12-03 16:31:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-12-03 16:31:59,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:59,634 INFO L402 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-12-03 16:31:59,634 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:59,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 78 times [2018-12-03 16:31:59,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:59,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:59,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 16:32:02,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:02,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:02,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:02,394 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:02,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:02,394 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:32:02,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:02,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:02,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:02,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:02,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 16:32:03,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 16:32:10,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:10,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:32:10,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:10,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:32:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:32:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:32:10,213 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-12-03 16:32:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:11,609 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-12-03 16:32:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:32:11,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-12-03 16:32:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:11,611 INFO L225 Difference]: With dead ends: 917 [2018-12-03 16:32:11,611 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 16:32:11,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1856 GetRequests, 1706 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:32:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 16:32:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-12-03 16:32:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 16:32:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-12-03 16:32:12,476 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-12-03 16:32:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:12,477 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-12-03 16:32:12,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:32:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-12-03 16:32:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-12-03 16:32:12,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:12,482 INFO L402 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-12-03 16:32:12,483 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:12,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 79 times [2018-12-03 16:32:12,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:12,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:12,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:12,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:12,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 16:32:15,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:15,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:15,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:15,530 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:15,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:15,530 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:32:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:15,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:16,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 16:32:16,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 16:32:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:32:23,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:23,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:32:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:32:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:32:23,433 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-12-03 16:32:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:24,737 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-12-03 16:32:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:32:24,737 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-12-03 16:32:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:24,739 INFO L225 Difference]: With dead ends: 929 [2018-12-03 16:32:24,739 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 16:32:24,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1881 GetRequests, 1729 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:32:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 16:32:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-12-03 16:32:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-03 16:32:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-12-03 16:32:25,604 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-12-03 16:32:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:25,605 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-12-03 16:32:25,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:32:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-12-03 16:32:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-12-03 16:32:25,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:25,610 INFO L402 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-12-03 16:32:25,610 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:25,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 80 times [2018-12-03 16:32:25,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:25,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:25,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:25,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 16:32:28,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:28,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:28,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:28,393 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:28,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:28,393 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:32:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:28,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:31,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 457 check-sat command(s) [2018-12-03 16:32:31,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:31,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 16:32:32,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 16:32:39,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:39,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:32:39,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:39,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:32:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:32:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:32:39,409 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-12-03 16:32:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:40,836 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-12-03 16:32:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:32:40,836 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-12-03 16:32:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:40,838 INFO L225 Difference]: With dead ends: 941 [2018-12-03 16:32:40,838 INFO L226 Difference]: Without dead ends: 939 [2018-12-03 16:32:40,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1906 GetRequests, 1752 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:32:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-12-03 16:32:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-12-03 16:32:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-12-03 16:32:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-12-03 16:32:41,765 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-12-03 16:32:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:41,765 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-12-03 16:32:41,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:32:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-12-03 16:32:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-12-03 16:32:41,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:41,771 INFO L402 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-12-03 16:32:41,771 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:41,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 81 times [2018-12-03 16:32:41,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:41,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:41,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:41,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:41,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 16:32:44,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:44,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:44,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:44,660 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:44,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:44,660 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:32:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:44,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:45,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:45,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:45,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 16:32:45,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 16:32:53,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:32:53,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:32:53,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:32:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:32:53,091 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-12-03 16:32:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:54,582 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-12-03 16:32:54,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:32:54,582 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-12-03 16:32:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:54,584 INFO L225 Difference]: With dead ends: 953 [2018-12-03 16:32:54,584 INFO L226 Difference]: Without dead ends: 951 [2018-12-03 16:32:54,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1775 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:32:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-03 16:32:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-12-03 16:32:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-03 16:32:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-12-03 16:32:55,544 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-12-03 16:32:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:55,544 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-12-03 16:32:55,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:32:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-12-03 16:32:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-12-03 16:32:55,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:55,552 INFO L402 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-12-03 16:32:55,553 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:55,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:55,553 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 82 times [2018-12-03 16:32:55,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:55,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:55,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:55,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:55,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 16:32:58,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:58,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:58,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:58,478 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:58,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:58,478 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:32:58,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:58,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:58,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 16:32:59,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 16:33:07,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:07,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:33:07,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:07,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:33:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:33:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:33:07,390 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-12-03 16:33:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:08,894 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-12-03 16:33:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:33:08,895 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-12-03 16:33:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:08,897 INFO L225 Difference]: With dead ends: 965 [2018-12-03 16:33:08,897 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 16:33:08,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1956 GetRequests, 1798 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:33:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 16:33:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-12-03 16:33:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-03 16:33:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-12-03 16:33:09,956 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-12-03 16:33:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:09,956 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-12-03 16:33:09,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:33:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-12-03 16:33:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-12-03 16:33:09,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:09,964 INFO L402 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-12-03 16:33:09,964 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:09,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 83 times [2018-12-03 16:33:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:09,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 16:33:13,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:13,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:13,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:13,078 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:13,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:13,078 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:33:13,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:13,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:16,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 470 check-sat command(s) [2018-12-03 16:33:16,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:16,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 16:33:17,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 16:33:25,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:25,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:33:25,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:25,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:33:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:33:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:33:25,027 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-12-03 16:33:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:26,541 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-12-03 16:33:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:33:26,541 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-12-03 16:33:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:26,543 INFO L225 Difference]: With dead ends: 977 [2018-12-03 16:33:26,543 INFO L226 Difference]: Without dead ends: 975 [2018-12-03 16:33:26,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1981 GetRequests, 1821 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:33:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-03 16:33:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-12-03 16:33:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-03 16:33:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-12-03 16:33:27,540 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-12-03 16:33:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:27,541 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-12-03 16:33:27,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:33:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-12-03 16:33:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-12-03 16:33:27,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:27,547 INFO L402 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-12-03 16:33:27,547 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:27,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 84 times [2018-12-03 16:33:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:27,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:27,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 16:33:30,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:30,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:30,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:30,767 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:30,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:30,768 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:33:30,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:30,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:31,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:31,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:31,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 16:33:31,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 16:33:39,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:39,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:33:39,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:39,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:33:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:33:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:33:39,844 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-12-03 16:33:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:41,373 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-12-03 16:33:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:33:41,373 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-12-03 16:33:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:41,375 INFO L225 Difference]: With dead ends: 989 [2018-12-03 16:33:41,375 INFO L226 Difference]: Without dead ends: 987 [2018-12-03 16:33:41,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2006 GetRequests, 1844 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:33:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-12-03 16:33:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-12-03 16:33:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-12-03 16:33:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-12-03 16:33:42,389 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-12-03 16:33:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:42,390 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-12-03 16:33:42,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:33:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-12-03 16:33:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-12-03 16:33:42,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:42,397 INFO L402 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-12-03 16:33:42,397 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:42,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 85 times [2018-12-03 16:33:42,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:42,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:42,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 16:33:45,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:45,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:45,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:45,647 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:45,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:45,648 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:33:45,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:45,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:46,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 16:33:46,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 16:33:54,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:54,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:33:54,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:54,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:33:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:33:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:33:54,901 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-12-03 16:33:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:56,501 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-12-03 16:33:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:33:56,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-12-03 16:33:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:56,503 INFO L225 Difference]: With dead ends: 1001 [2018-12-03 16:33:56,503 INFO L226 Difference]: Without dead ends: 999 [2018-12-03 16:33:56,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1867 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:33:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-12-03 16:33:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-12-03 16:33:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-12-03 16:33:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-12-03 16:33:57,542 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-12-03 16:33:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:57,542 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-12-03 16:33:57,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:33:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-12-03 16:33:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-12-03 16:33:57,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:57,548 INFO L402 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-12-03 16:33:57,549 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:57,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 86 times [2018-12-03 16:33:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:57,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:57,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 16:34:00,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:00,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:00,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:00,809 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:00,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:00,809 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:34:00,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:00,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:04,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 493 check-sat command(s) [2018-12-03 16:34:04,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:04,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 16:34:05,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 16:34:13,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:13,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:34:13,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:13,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:34:13,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:34:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:34:13,749 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-12-03 16:34:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:15,430 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-12-03 16:34:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:34:15,430 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-12-03 16:34:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:15,433 INFO L225 Difference]: With dead ends: 1013 [2018-12-03 16:34:15,433 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 16:34:15,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2056 GetRequests, 1890 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:34:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 16:34:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-12-03 16:34:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 16:34:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-12-03 16:34:16,658 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-12-03 16:34:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:16,659 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-12-03 16:34:16,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:34:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-12-03 16:34:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-12-03 16:34:16,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:16,665 INFO L402 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-12-03 16:34:16,665 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:16,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 87 times [2018-12-03 16:34:16,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:16,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:16,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 16:34:19,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:19,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:19,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:19,979 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:19,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:19,979 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:34:19,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:19,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:20,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:20,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:20,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 16:34:21,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 16:34:29,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:29,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:34:29,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:29,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:34:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:34:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:34:29,719 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-12-03 16:34:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:31,423 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-12-03 16:34:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:34:31,423 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-12-03 16:34:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:31,424 INFO L225 Difference]: With dead ends: 1025 [2018-12-03 16:34:31,424 INFO L226 Difference]: Without dead ends: 1023 [2018-12-03 16:34:31,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2081 GetRequests, 1913 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:34:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-12-03 16:34:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-12-03 16:34:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-03 16:34:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-12-03 16:34:32,490 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-12-03 16:34:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:32,490 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-12-03 16:34:32,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:34:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-12-03 16:34:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-12-03 16:34:32,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:32,497 INFO L402 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-12-03 16:34:32,497 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:32,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 88 times [2018-12-03 16:34:32,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:32,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:32,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:32,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:32,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 16:34:35,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:35,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:35,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:35,894 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:35,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:35,894 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:34:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:35,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:36,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 16:34:37,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 16:34:45,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:45,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:34:45,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:45,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:34:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:34:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:34:45,765 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-12-03 16:34:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:47,532 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-12-03 16:34:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:34:47,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-12-03 16:34:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:47,533 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 16:34:47,533 INFO L226 Difference]: Without dead ends: 1035 [2018-12-03 16:34:47,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2106 GetRequests, 1936 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:34:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-03 16:34:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-12-03 16:34:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-12-03 16:34:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-12-03 16:34:48,699 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-12-03 16:34:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:48,700 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-12-03 16:34:48,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:34:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-12-03 16:34:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-12-03 16:34:48,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:48,707 INFO L402 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-12-03 16:34:48,707 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:48,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 89 times [2018-12-03 16:34:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:48,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 16:34:52,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:52,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:52,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:52,207 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:52,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:52,207 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:34:52,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:52,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:56,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 506 check-sat command(s) [2018-12-03 16:34:56,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:56,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 16:34:56,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 16:35:05,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:05,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:35:05,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:05,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:35:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:35:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:35:05,853 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-12-03 16:35:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:07,741 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-12-03 16:35:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:35:07,741 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-12-03 16:35:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:07,743 INFO L225 Difference]: With dead ends: 1049 [2018-12-03 16:35:07,743 INFO L226 Difference]: Without dead ends: 1047 [2018-12-03 16:35:07,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 1959 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:35:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-12-03 16:35:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-12-03 16:35:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-03 16:35:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-12-03 16:35:08,929 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-12-03 16:35:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:08,930 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-12-03 16:35:08,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:35:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-12-03 16:35:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-12-03 16:35:08,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:08,936 INFO L402 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-12-03 16:35:08,936 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:08,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 90 times [2018-12-03 16:35:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:08,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:08,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 16:35:12,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:12,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:12,457 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:12,457 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:12,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:12,457 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:35:12,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:35:12,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:35:13,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:35:13,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:13,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 16:35:13,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 16:35:22,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:22,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:35:22,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:22,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:35:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:35:22,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:35:22,702 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-12-03 16:35:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:24,593 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-12-03 16:35:24,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:35:24,594 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-12-03 16:35:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:24,595 INFO L225 Difference]: With dead ends: 1061 [2018-12-03 16:35:24,595 INFO L226 Difference]: Without dead ends: 1059 [2018-12-03 16:35:24,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2156 GetRequests, 1982 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:35:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-12-03 16:35:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-12-03 16:35:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-12-03 16:35:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-12-03 16:35:25,806 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-12-03 16:35:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:25,806 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-12-03 16:35:25,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:35:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-12-03 16:35:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-12-03 16:35:25,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:25,813 INFO L402 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-12-03 16:35:25,813 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:25,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 91 times [2018-12-03 16:35:25,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:25,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:25,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:25,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:25,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 16:35:29,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:29,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:29,731 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:29,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:35:29,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:29,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 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:35:29,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:29,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:30,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 16:35:31,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 16:35:40,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:40,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:35:40,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:35:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:35:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:35:40,532 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-12-03 16:35:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:42,423 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-12-03 16:35:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:35:42,423 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-12-03 16:35:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:42,424 INFO L225 Difference]: With dead ends: 1073 [2018-12-03 16:35:42,424 INFO L226 Difference]: Without dead ends: 1071 [2018-12-03 16:35:42,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2181 GetRequests, 2005 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:35:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-12-03 16:35:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-12-03 16:35:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-12-03 16:35:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-12-03 16:35:43,708 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-12-03 16:35:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:43,709 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-12-03 16:35:43,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:35:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-12-03 16:35:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-12-03 16:35:43,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:43,715 INFO L402 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-12-03 16:35:43,716 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:43,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 92 times [2018-12-03 16:35:43,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:43,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:43,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:43,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:43,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 16:35:47,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:47,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:47,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:47,404 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:47,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:47,404 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:35:47,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:47,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:51,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 529 check-sat command(s) [2018-12-03 16:35:51,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:51,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 16:35:52,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 16:36:02,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:02,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:36:02,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:02,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:36:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:36:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:36:02,366 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-12-03 16:36:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:04,216 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-12-03 16:36:04,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:36:04,216 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-12-03 16:36:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:04,218 INFO L225 Difference]: With dead ends: 1085 [2018-12-03 16:36:04,218 INFO L226 Difference]: Without dead ends: 1083 [2018-12-03 16:36:04,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2206 GetRequests, 2028 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:36:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-12-03 16:36:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-12-03 16:36:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-12-03 16:36:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-12-03 16:36:05,437 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-12-03 16:36:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:05,437 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-12-03 16:36:05,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:36:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-12-03 16:36:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-12-03 16:36:05,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:05,444 INFO L402 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-12-03 16:36:05,444 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:05,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 93 times [2018-12-03 16:36:05,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:05,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:05,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:05,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:05,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 16:36:09,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:09,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:09,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:09,292 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:09,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:09,292 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:36:09,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:36:09,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:36:09,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:36:09,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:09,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 16:36:10,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 16:36:20,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:20,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:36:20,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:20,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:36:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:36:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:36:20,513 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-12-03 16:36:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:22,558 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-12-03 16:36:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:36:22,558 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-12-03 16:36:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:22,559 INFO L225 Difference]: With dead ends: 1097 [2018-12-03 16:36:22,559 INFO L226 Difference]: Without dead ends: 1095 [2018-12-03 16:36:22,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2231 GetRequests, 2051 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:36:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-12-03 16:36:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-12-03 16:36:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-12-03 16:36:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-12-03 16:36:23,901 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-12-03 16:36:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:23,902 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-12-03 16:36:23,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:36:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-12-03 16:36:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-12-03 16:36:23,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:23,908 INFO L402 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-12-03 16:36:23,909 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:23,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 94 times [2018-12-03 16:36:23,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:23,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:23,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 16:36:28,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:28,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:28,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:28,037 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:28,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:28,037 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:36:28,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:28,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:36:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:28,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 16:36:29,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 16:36:39,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:39,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:36:39,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:39,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:36:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:36:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:36:39,443 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-12-03 16:36:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:41,364 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-12-03 16:36:41,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:36:41,365 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-12-03 16:36:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:41,366 INFO L225 Difference]: With dead ends: 1109 [2018-12-03 16:36:41,366 INFO L226 Difference]: Without dead ends: 1107 [2018-12-03 16:36:41,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2256 GetRequests, 2074 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:36:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-12-03 16:36:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-12-03 16:36:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-12-03 16:36:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-12-03 16:36:42,749 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-12-03 16:36:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:42,750 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-12-03 16:36:42,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:36:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-12-03 16:36:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-12-03 16:36:42,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:42,758 INFO L402 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-12-03 16:36:42,758 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:42,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 95 times [2018-12-03 16:36:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:42,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:42,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 16:36:47,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:47,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:47,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:47,001 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:47,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:47,001 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:36:47,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:47,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:51,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 542 check-sat command(s) [2018-12-03 16:36:51,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:51,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 16:36:52,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 16:37:02,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:02,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:37:02,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:02,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:37:02,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:37:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:37:02,705 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-12-03 16:37:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:04,863 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-12-03 16:37:04,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:37:04,863 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-12-03 16:37:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:04,864 INFO L225 Difference]: With dead ends: 1121 [2018-12-03 16:37:04,864 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 16:37:04,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2281 GetRequests, 2097 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:37:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 16:37:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-12-03 16:37:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-12-03 16:37:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-12-03 16:37:06,274 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-12-03 16:37:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:06,275 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-12-03 16:37:06,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:37:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-12-03 16:37:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-12-03 16:37:06,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:06,282 INFO L402 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-12-03 16:37:06,282 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:06,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:06,283 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 96 times [2018-12-03 16:37:06,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:06,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:06,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:06,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 16:37:10,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:10,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:10,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:10,313 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:37:10,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:10,313 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:37:10,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:10,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:10,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:10,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:10,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 16:37:11,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 16:37:22,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:37:22,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:22,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:37:22,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:37:22,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:37:22,099 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-12-03 16:37:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:24,250 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-12-03 16:37:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:37:24,250 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-12-03 16:37:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:24,251 INFO L225 Difference]: With dead ends: 1133 [2018-12-03 16:37:24,252 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 16:37:24,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2306 GetRequests, 2120 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:37:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 16:37:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-12-03 16:37:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-12-03 16:37:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-12-03 16:37:25,610 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-12-03 16:37:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:25,611 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-12-03 16:37:25,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:37:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-12-03 16:37:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-12-03 16:37:25,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:25,618 INFO L402 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-12-03 16:37:25,618 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:25,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 97 times [2018-12-03 16:37:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:25,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:25,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 16:37:29,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:29,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:29,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:29,896 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:37:29,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:29,896 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:37:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:29,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:30,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 16:37:31,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 16:37:41,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:41,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:37:41,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:41,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:37:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:37:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:37:41,642 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-12-03 16:37:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:43,855 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-12-03 16:37:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:37:43,855 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-12-03 16:37:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:43,856 INFO L225 Difference]: With dead ends: 1145 [2018-12-03 16:37:43,856 INFO L226 Difference]: Without dead ends: 1143 [2018-12-03 16:37:43,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2331 GetRequests, 2143 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:37:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-12-03 16:37:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-12-03 16:37:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 16:37:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-12-03 16:37:45,217 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-12-03 16:37:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:45,218 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-12-03 16:37:45,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:37:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-12-03 16:37:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-12-03 16:37:45,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:45,225 INFO L402 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-12-03 16:37:45,225 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:45,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 98 times [2018-12-03 16:37:45,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:45,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:45,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 16:37:49,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:49,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:49,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:49,651 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:37:49,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:49,651 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:37:49,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:49,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:37:54,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 565 check-sat command(s) [2018-12-03 16:37:54,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:54,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 16:37:55,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 16:38:06,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:06,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:38:06,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:06,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:38:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:38:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:38:06,534 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-12-03 16:38:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:08,676 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-12-03 16:38:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:38:08,677 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-12-03 16:38:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:08,678 INFO L225 Difference]: With dead ends: 1157 [2018-12-03 16:38:08,678 INFO L226 Difference]: Without dead ends: 1155 [2018-12-03 16:38:08,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2356 GetRequests, 2166 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:38:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-03 16:38:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-12-03 16:38:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-12-03 16:38:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-12-03 16:38:10,229 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-12-03 16:38:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:10,229 INFO L480 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-12-03 16:38:10,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:38:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-12-03 16:38:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-12-03 16:38:10,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:10,239 INFO L402 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-12-03 16:38:10,239 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:10,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 99 times [2018-12-03 16:38:10,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:10,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:10,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-12-03 16:38:14,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:14,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:14,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:14,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:38:14,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:14,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 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:38:14,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:14,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:15,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:15,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:15,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-12-03 16:38:16,366 INFO L316 TraceCheckSpWp]: Computing backward predicates...