java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:48:06,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:48:06,723 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:48:06,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:48:06,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:48:06,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:48:06,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:48:06,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:48:06,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:48:06,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:48:06,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:48:06,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:48:06,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:48:06,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:48:06,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:48:06,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:48:06,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:48:06,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:48:06,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:48:06,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:48:06,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:48:06,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:48:06,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:48:06,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:48:06,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:48:06,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:48:06,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:48:06,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:48:06,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:48:06,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:48:06,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:48:06,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:48:06,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:48:06,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:48:06,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:48:06,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:48:06,778 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:48:06,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:48:06,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:48:06,803 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:48:06,803 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:48:06,804 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:48:06,804 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:48:06,804 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:48:06,804 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:48:06,804 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:48:06,805 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:48:06,805 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:48:06,805 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:48:06,806 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:48:06,806 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:48:06,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:48:06,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:48:06,807 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:48:06,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:48:06,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:48:06,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:48:06,809 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:48:06,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:48:06,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:48:06,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:48:06,810 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:48:06,810 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:48:06,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:48:06,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:48:06,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:48:06,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:48:06,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:48:06,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:48:06,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:48:06,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:48:06,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:48:06,812 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:48:06,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:48:06,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:48:06,813 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:48:06,813 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:48:06,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:48:06,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:48:06,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:48:06,884 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:48:06,885 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:48:06,885 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 18:48:06,886 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 18:48:06,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:48:06,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:48:06,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:48:06,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:48:06,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:48:06,951 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,961 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:48:06,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:48:06,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:48:06,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:48:06,983 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,984 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,985 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,985 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,989 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 06:48:06" (1/1) ... [2018-12-03 18:48:06,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 06:48:06" (1/1) ... [2018-12-03 18:48:06,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 06:48:06" (1/1) ... [2018-12-03 18:48:06,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:48:06,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:48:06,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:48:06,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:48:06,995 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 06:48:06" (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 18:48:07,064 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:48:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:48:07,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:48:07,340 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:48:07,341 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:48:07,341 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:48:07 BoogieIcfgContainer [2018-12-03 18:48:07,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:48:07,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:48:07,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:48:07,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:48:07,347 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 06:48:06" (1/2) ... [2018-12-03 18:48:07,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c1a4f5 and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:48:07, skipping insertion in model container [2018-12-03 18:48:07,349 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 06:48:07" (2/2) ... [2018-12-03 18:48:07,351 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 18:48:07,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:48:07,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:48:07,392 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:48:07,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:48:07,436 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:48:07,436 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:48:07,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:48:07,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:48:07,437 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:48:07,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:48:07,438 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:48:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 18:48:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:48:07,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:48:07,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:48:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:07,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:07,666 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 18:48:07,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:07,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:48:07,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:07,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:48:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:48:07,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:48:07,695 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 18:48:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:07,752 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 18:48:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:48:07,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:48:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:07,766 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:48:07,767 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:48:07,771 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 18:48:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:48:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 18:48:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:48:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 18:48:07,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 18:48:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:07,837 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 18:48:07,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:48:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 18:48:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:48:07,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:48:07,843 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,844 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-12-03 18:48:07,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:07,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:07,922 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 18:48:07,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:07,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:48:07,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:07,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:48:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:48:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:48:07,925 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-12-03 18:48:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:07,978 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 18:48:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:48:07,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 18:48:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:07,980 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:48:07,980 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:48:07,981 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 18:48:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:48:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:48:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:48:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 18:48:07,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 18:48:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:07,985 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 18:48:07,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:48:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 18:48:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:48:07,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 18:48:07,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-12-03 18:48:07,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,075 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 18:48:08,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:08,077 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 18:48:08,080 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 18:48:08,156 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:48:08,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:48:08,511 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:48:08,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:48:08,574 INFO L272 AbstractInterpreter]: Visited 6 different actions 58 times. Merged at 5 different actions 29 times. Widened at 3 different actions 17 times. Found 12 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 18:48:08,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:08,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:48:08,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,590 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 18:48:08,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:08,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:08,654 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 18:48:08,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:08,721 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 18:48:08,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:08,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 18:48:08,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:08,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:48:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:48:08,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:48:08,744 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 18:48:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:08,774 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 18:48:08,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:48:08,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 18:48:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:08,776 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:48:08,776 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:48:08,777 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 18:48:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:48:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:48:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:48:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 18:48:08,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 18:48:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:08,781 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 18:48:08,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:48:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 18:48:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:48:08,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:08,782 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 18:48:08,782 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:08,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-12-03 18:48:08,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:08,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:08,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,833 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 18:48:08,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:08,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:08,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:08,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,836 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 18:48:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:08,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:08,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:48:08,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:08,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:08,877 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 18:48:08,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:08,941 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 18:48:08,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:48:08,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:48:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:48:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:48:08,966 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 18:48:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:09,039 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 18:48:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:48:09,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 18:48:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:09,042 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:48:09,042 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:48:09,042 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 18:48:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:48:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 18:48:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:48:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 18:48:09,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 18:48:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:09,049 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 18:48:09,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:48:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 18:48:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:48:09,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:09,053 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 18:48:09,053 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:09,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-12-03 18:48:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:09,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:09,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:09,125 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 18:48:09,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:09,126 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:09,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,127 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 18:48:09,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:09,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:09,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:09,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:09,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:09,201 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 18:48:09,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:09,433 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 18:48:09,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:09,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-03 18:48:09,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:09,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:48:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:48:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:48:09,454 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-03 18:48:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:09,503 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 18:48:09,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:48:09,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-03 18:48:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:09,504 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:48:09,505 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:48:09,505 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 18:48:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:48:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:48:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:48:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 18:48:09,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 18:48:09,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:09,510 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 18:48:09,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:48:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 18:48:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:48:09,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:09,511 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 18:48:09,512 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:09,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-12-03 18:48:09,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:09,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:09,607 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 18:48:09,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:09,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:09,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:09,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,608 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 18:48:09,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:09,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:09,653 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 18:48:09,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:09,854 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 18:48:09,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:09,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 18:48:09,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:09,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:48:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:48:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:48:09,876 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-12-03 18:48:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:09,905 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 18:48:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:48:09,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-03 18:48:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:09,906 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:48:09,906 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:48:09,907 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 18:48:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:48:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:48:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:48:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 18:48:09,911 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 18:48:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:09,911 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 18:48:09,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:48:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 18:48:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:48:09,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:09,912 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 18:48:09,913 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:09,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-12-03 18:48:09,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:09,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:09,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:10,055 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 18:48:10,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:10,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:10,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:10,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:10,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:10,056 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 18:48:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:10,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:10,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:48:10,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:10,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:10,159 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 18:48:10,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:10,570 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 18:48:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:10,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2018-12-03 18:48:10,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:10,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:48:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:48:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:48:10,592 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-12-03 18:48:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:11,094 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-12-03 18:48:11,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:48:11,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 18:48:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:11,095 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:48:11,096 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:48:11,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:48:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:48:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-12-03 18:48:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:48:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-03 18:48:11,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-12-03 18:48:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:11,103 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-03 18:48:11,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:48:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-03 18:48:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:48:11,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:11,104 INFO L402 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-12-03 18:48:11,104 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:11,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:11,104 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 6 times [2018-12-03 18:48:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:11,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:11,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:11,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:11,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:11,251 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 18:48:11,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:11,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:11,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:11,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:11,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:11,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:11,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:11,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:11,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:11,441 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 18:48:11,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:11,631 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 18:48:11,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:11,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2018-12-03 18:48:11,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:11,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:48:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:48:11,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:48:11,659 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-12-03 18:48:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:12,158 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-03 18:48:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:48:12,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-03 18:48:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:12,159 INFO L225 Difference]: With dead ends: 60 [2018-12-03 18:48:12,159 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:48:12,160 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 18:48:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:48:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-12-03 18:48:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:48:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-03 18:48:12,168 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-12-03 18:48:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:12,168 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-03 18:48:12,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:48:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-03 18:48:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:48:12,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:12,170 INFO L402 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-12-03 18:48:12,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:12,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 7 times [2018-12-03 18:48:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,336 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 18:48:12,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:12,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:12,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:12,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,337 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 18:48:12,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:12,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:12,380 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 18:48:12,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:12,520 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 18:48:12,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2018-12-03 18:48:12,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:48:12,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:48:12,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:48:12,551 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-12-03 18:48:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:12,586 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-03 18:48:12,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:48:12,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-03 18:48:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:12,591 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:48:12,591 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:48:12,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:48:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:48:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:48:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:48:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-03 18:48:12,599 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-12-03 18:48:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:12,599 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-03 18:48:12,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:48:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-03 18:48:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:48:12,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:12,600 INFO L402 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-12-03 18:48:12,601 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:12,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 8 times [2018-12-03 18:48:12,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,734 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 18:48:12,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:12,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:12,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:12,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,735 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 18:48:12,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:12,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:12,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:48:12,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:12,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:12,882 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 18:48:12,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:13,000 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 18:48:13,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:13,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 17 [2018-12-03 18:48:13,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:13,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:48:13,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:48:13,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:48:13,020 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-12-03 18:48:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:14,556 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-12-03 18:48:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:48:14,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 18:48:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:14,557 INFO L225 Difference]: With dead ends: 93 [2018-12-03 18:48:14,557 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:48:14,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1046, Invalid=2146, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 18:48:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:48:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-03 18:48:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:48:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 18:48:14,571 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-12-03 18:48:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:14,571 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 18:48:14,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:48:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 18:48:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:48:14,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:14,573 INFO L402 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-12-03 18:48:14,574 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:14,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 9 times [2018-12-03 18:48:14,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:14,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:14,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:14,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:14,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:14,723 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 18:48:14,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:14,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:14,724 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:14,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:14,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:14,724 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 18:48:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:14,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:14,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:14,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:14,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:15,015 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 18:48:15,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:15,615 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 18:48:15,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:15,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 18 [2018-12-03 18:48:15,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:15,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:48:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:48:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:48:15,635 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-12-03 18:48:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:16,878 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-03 18:48:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 18:48:16,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-12-03 18:48:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:16,886 INFO L225 Difference]: With dead ends: 123 [2018-12-03 18:48:16,886 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 18:48:16,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1605, Invalid=3507, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:48:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 18:48:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-12-03 18:48:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:48:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-03 18:48:16,914 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-12-03 18:48:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:16,915 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-03 18:48:16,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:48:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-03 18:48:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 18:48:16,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:16,916 INFO L402 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-12-03 18:48:16,919 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:16,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 10 times [2018-12-03 18:48:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,227 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 18:48:17,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:17,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:17,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:17,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,228 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 18:48:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:17,820 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 18:48:17,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:18,135 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 18:48:18,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:18,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 19 [2018-12-03 18:48:18,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:18,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:48:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:48:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:48:18,156 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-12-03 18:48:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:20,858 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-12-03 18:48:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 18:48:20,858 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-12-03 18:48:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:20,859 INFO L225 Difference]: With dead ends: 157 [2018-12-03 18:48:20,859 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 18:48:20,862 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 18:48:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 18:48:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 18:48:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:48:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 18:48:20,879 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-12-03 18:48:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:20,879 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 18:48:20,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:48:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 18:48:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:48:20,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:20,881 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 18:48:20,881 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:20,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 11 times [2018-12-03 18:48:20,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:20,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:20,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:20,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:20,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:21,184 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 18:48:21,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:21,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:21,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:21,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:21,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:21,185 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 18:48:21,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:21,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:21,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 18:48:21,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:21,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:21,329 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 18:48:21,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:21,650 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 18:48:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:21,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:48:21,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:21,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:48:21,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:48:21,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:48:21,673 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-12-03 18:48:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:21,712 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 18:48:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:48:21,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-03 18:48:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:21,714 INFO L225 Difference]: With dead ends: 113 [2018-12-03 18:48:21,714 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 18:48:21,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:48:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 18:48:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 18:48:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:48:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 18:48:21,733 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 18:48:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:21,734 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 18:48:21,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:48:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 18:48:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:48:21,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:21,736 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 18:48:21,736 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:21,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 12 times [2018-12-03 18:48:21,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:21,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:21,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:21,907 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 18:48:21,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:21,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:21,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:21,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:21,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:21,908 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 18:48:21,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:21,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:21,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:21,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:22,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:22,019 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 18:48:22,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:22,288 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 18:48:22,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:22,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 18:48:22,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:22,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:48:22,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:48:22,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:48:22,310 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-12-03 18:48:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:22,543 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 18:48:22,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:48:22,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-03 18:48:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:22,545 INFO L225 Difference]: With dead ends: 125 [2018-12-03 18:48:22,545 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 18:48:22,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:48:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 18:48:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 18:48:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 18:48:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 18:48:22,570 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 18:48:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:22,570 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 18:48:22,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:48:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 18:48:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:48:22,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:22,572 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 18:48:22,573 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:22,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:22,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 13 times [2018-12-03 18:48:22,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:22,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:22,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:22,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:22,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:22,898 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 18:48:22,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:22,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:22,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:22,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:22,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:22,900 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 18:48:22,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:22,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:22,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:23,040 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 18:48:23,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:23,610 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 18:48:23,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:23,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:48:23,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:23,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:48:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:48:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:48:23,632 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-12-03 18:48:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:23,788 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 18:48:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:48:23,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-12-03 18:48:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:23,790 INFO L225 Difference]: With dead ends: 137 [2018-12-03 18:48:23,790 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 18:48:23,791 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 18:48:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 18:48:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 18:48:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 18:48:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 18:48:23,817 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 18:48:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:23,818 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 18:48:23,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:48:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 18:48:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 18:48:23,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:23,820 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 18:48:23,820 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:23,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 14 times [2018-12-03 18:48:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:23,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:23,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:24,127 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 18:48:24,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:24,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:24,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:24,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:24,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:24,128 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 18:48:24,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:24,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:24,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 18:48:24,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:24,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:24,273 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 18:48:24,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:24,483 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 18:48:24,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:24,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:48:24,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:24,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:48:24,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:48:24,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:48:24,504 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-12-03 18:48:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:24,661 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-12-03 18:48:24,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:48:24,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-12-03 18:48:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:24,662 INFO L225 Difference]: With dead ends: 149 [2018-12-03 18:48:24,663 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 18:48:24,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:48:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 18:48:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-12-03 18:48:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 18:48:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-03 18:48:24,693 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-12-03 18:48:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:24,693 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-03 18:48:24,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:48:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-03 18:48:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 18:48:24,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:24,695 INFO L402 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-12-03 18:48:24,695 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:24,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 15 times [2018-12-03 18:48:24,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:24,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:24,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:24,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:25,099 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 18:48:25,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:25,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:25,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:25,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:25,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:25,100 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 18:48:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:25,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:25,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:25,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:25,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:25,233 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 18:48:25,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:25,495 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 18:48:25,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:25,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 18:48:25,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:25,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:48:25,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:48:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:48:25,516 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-12-03 18:48:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:25,585 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-12-03 18:48:25,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:48:25,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-12-03 18:48:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:25,587 INFO L225 Difference]: With dead ends: 161 [2018-12-03 18:48:25,587 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 18:48:25,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:48:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 18:48:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-12-03 18:48:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 18:48:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-12-03 18:48:25,612 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-12-03 18:48:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:25,613 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-12-03 18:48:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:48:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-12-03 18:48:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 18:48:25,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:25,614 INFO L402 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-12-03 18:48:25,614 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:25,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 16 times [2018-12-03 18:48:25,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:25,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:25,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:26,419 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 18:48:26,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:26,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:26,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:26,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:26,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:26,420 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 18:48:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:26,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:26,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:26,549 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 18:48:26,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:26,865 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 18:48:26,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:26,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:48:26,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:26,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:48:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:48:26,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:48:26,898 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-12-03 18:48:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:27,145 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-12-03 18:48:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:48:27,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-12-03 18:48:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:27,147 INFO L225 Difference]: With dead ends: 173 [2018-12-03 18:48:27,147 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 18:48:27,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:48:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 18:48:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-12-03 18:48:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 18:48:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-12-03 18:48:27,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-12-03 18:48:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:27,171 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-12-03 18:48:27,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:48:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-12-03 18:48:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 18:48:27,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:27,173 INFO L402 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-12-03 18:48:27,173 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:27,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 17 times [2018-12-03 18:48:27,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:27,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:27,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:27,437 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 18:48:27,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:27,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:27,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:27,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:27,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:27,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 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 18:48:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:27,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:27,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 18:48:27,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:27,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:27,625 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 18:48:27,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:28,036 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 18:48:28,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:28,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:48:28,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:28,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:48:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:48:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:48:28,057 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-12-03 18:48:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:28,170 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-12-03 18:48:28,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:48:28,170 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-12-03 18:48:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:28,172 INFO L225 Difference]: With dead ends: 185 [2018-12-03 18:48:28,172 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 18:48:28,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:48:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 18:48:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-12-03 18:48:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 18:48:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-12-03 18:48:28,205 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-12-03 18:48:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:28,206 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-12-03 18:48:28,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:48:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-12-03 18:48:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 18:48:28,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:28,208 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-12-03 18:48:28,208 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:28,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 18 times [2018-12-03 18:48:28,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:28,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:28,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:28,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:28,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:28,545 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 18:48:28,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:28,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:28,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:28,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 18:48:28,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:28,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 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 18:48:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:28,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:28,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:28,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:28,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:28,677 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 18:48:28,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:29,010 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 18:48:29,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:29,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 18:48:29,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:29,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:48:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:48:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:48:29,031 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-12-03 18:48:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:29,146 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-12-03 18:48:29,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:48:29,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-12-03 18:48:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:29,147 INFO L225 Difference]: With dead ends: 197 [2018-12-03 18:48:29,148 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 18:48:29,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:48:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 18:48:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-12-03 18:48:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 18:48:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-12-03 18:48:29,184 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-12-03 18:48:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:29,184 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-12-03 18:48:29,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:48:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-12-03 18:48:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 18:48:29,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:29,185 INFO L402 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-12-03 18:48:29,186 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:29,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 19 times [2018-12-03 18:48:29,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:29,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:29,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:29,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:29,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:29,647 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 18:48:29,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:29,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:29,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:29,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:29,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:29,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 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 18:48:29,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:29,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:29,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:29,789 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 18:48:29,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:30,468 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 18:48:30,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:30,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:48:30,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:30,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:48:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:48:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:48:30,489 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-12-03 18:48:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:30,587 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-12-03 18:48:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:48:30,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-12-03 18:48:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:30,589 INFO L225 Difference]: With dead ends: 209 [2018-12-03 18:48:30,589 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 18:48:30,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:48:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 18:48:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-12-03 18:48:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 18:48:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-12-03 18:48:30,625 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-12-03 18:48:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:30,626 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-12-03 18:48:30,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:48:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-12-03 18:48:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 18:48:30,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:30,627 INFO L402 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-12-03 18:48:30,627 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:30,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 20 times [2018-12-03 18:48:30,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:30,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:30,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:30,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:31,375 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 18:48:31,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:31,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:31,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:31,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:31,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:31,376 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 18:48:31,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:31,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:31,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 97 check-sat command(s) [2018-12-03 18:48:31,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:31,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:31,627 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 18:48:31,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:32,035 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 18:48:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:48:32,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:32,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:48:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:48:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:48:32,057 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-12-03 18:48:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:32,173 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-12-03 18:48:32,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:48:32,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-12-03 18:48:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:32,178 INFO L225 Difference]: With dead ends: 221 [2018-12-03 18:48:32,178 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 18:48:32,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:48:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 18:48:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-12-03 18:48:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 18:48:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-12-03 18:48:32,218 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-12-03 18:48:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-12-03 18:48:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:48:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-12-03 18:48:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 18:48:32,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:32,219 INFO L402 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-12-03 18:48:32,219 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:32,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 21 times [2018-12-03 18:48:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:32,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:32,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:32,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:33,163 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 18:48:33,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:33,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:33,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:33,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:33,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:33,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:33,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:33,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:33,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:33,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:33,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:33,329 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 18:48:33,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:33,762 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 18:48:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 18:48:33,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:48:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:48:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:48:33,784 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-12-03 18:48:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:33,925 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-03 18:48:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:48:33,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-12-03 18:48:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:33,927 INFO L225 Difference]: With dead ends: 233 [2018-12-03 18:48:33,927 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 18:48:33,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:48:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 18:48:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-12-03 18:48:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 18:48:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-12-03 18:48:33,973 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-12-03 18:48:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:33,974 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-12-03 18:48:33,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:48:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-12-03 18:48:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 18:48:33,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:33,975 INFO L402 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-12-03 18:48:33,975 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:33,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 22 times [2018-12-03 18:48:33,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:33,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:33,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:34,738 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 18:48:34,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:34,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:34,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:34,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:34,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:34,739 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 18:48:34,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:34,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:34,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:34,924 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 18:48:34,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:35,741 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 18:48:35,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:48:35,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:35,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:48:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:48:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:48:35,765 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-12-03 18:48:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:35,895 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-12-03 18:48:35,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:48:35,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-12-03 18:48:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:35,897 INFO L225 Difference]: With dead ends: 245 [2018-12-03 18:48:35,897 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 18:48:35,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:48:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 18:48:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-12-03 18:48:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 18:48:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-03 18:48:35,948 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-12-03 18:48:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:35,949 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-03 18:48:35,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:48:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-03 18:48:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 18:48:35,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:35,951 INFO L402 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-12-03 18:48:35,951 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:35,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 23 times [2018-12-03 18:48:35,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:35,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:35,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:35,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:36,704 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 18:48:36,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:36,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:36,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:36,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 18:48:36,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:36,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 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 18:48:36,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:36,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:36,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) [2018-12-03 18:48:36,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:37,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:37,045 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 18:48:37,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:37,576 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 18:48:37,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:48:37,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:37,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:48:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:48:37,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:48:37,599 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-12-03 18:48:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:37,795 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-12-03 18:48:37,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:48:37,795 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-12-03 18:48:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:37,797 INFO L225 Difference]: With dead ends: 257 [2018-12-03 18:48:37,797 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 18:48:37,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:48:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 18:48:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-12-03 18:48:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-03 18:48:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-12-03 18:48:37,855 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-12-03 18:48:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:37,855 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-12-03 18:48:37,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:48:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-12-03 18:48:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 18:48:37,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:37,857 INFO L402 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-12-03 18:48:37,857 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:37,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 24 times [2018-12-03 18:48:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:37,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:37,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:39,487 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 18:48:39,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:39,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:39,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:39,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:39,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:39,488 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 18:48:39,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:39,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:39,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:39,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:39,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:39,688 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 18:48:39,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:40,336 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 18:48:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:40,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 18:48:40,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:40,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:48:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:48:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:48:40,357 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-12-03 18:48:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:40,521 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-12-03 18:48:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:48:40,522 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-12-03 18:48:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:40,524 INFO L225 Difference]: With dead ends: 269 [2018-12-03 18:48:40,524 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 18:48:40,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:48:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 18:48:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-12-03 18:48:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-03 18:48:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-12-03 18:48:40,590 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-12-03 18:48:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:40,590 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-12-03 18:48:40,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:48:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-12-03 18:48:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-03 18:48:40,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:40,592 INFO L402 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-12-03 18:48:40,592 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:40,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 25 times [2018-12-03 18:48:40,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:40,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:40,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:40,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:40,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:41,562 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 18:48:41,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:41,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:41,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:41,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:41,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:41,563 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 18:48:41,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:41,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:41,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:41,766 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 18:48:41,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:42,483 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 18:48:42,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:42,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:48:42,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:42,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:48:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:48:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:48:42,504 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-12-03 18:48:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:42,742 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-12-03 18:48:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:48:42,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-12-03 18:48:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:42,743 INFO L225 Difference]: With dead ends: 281 [2018-12-03 18:48:42,743 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 18:48:42,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:48:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 18:48:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-03 18:48:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 18:48:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-12-03 18:48:42,812 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-12-03 18:48:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:42,813 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-12-03 18:48:42,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:48:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-12-03 18:48:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-03 18:48:42,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:42,815 INFO L402 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-12-03 18:48:42,815 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:42,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 26 times [2018-12-03 18:48:42,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:42,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:42,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:43,738 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 18:48:43,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:43,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:43,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:43,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:43,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:43,739 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 18:48:43,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:43,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:44,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 133 check-sat command(s) [2018-12-03 18:48:44,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:44,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:44,155 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 18:48:44,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:46,184 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 18:48:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:46,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:48:46,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:46,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:48:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:48:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:48:46,206 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-12-03 18:48:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:46,406 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-12-03 18:48:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:48:46,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-12-03 18:48:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:46,408 INFO L225 Difference]: With dead ends: 293 [2018-12-03 18:48:46,409 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 18:48:46,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:48:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 18:48:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-12-03 18:48:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 18:48:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-12-03 18:48:46,524 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-12-03 18:48:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:46,524 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-12-03 18:48:46,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:48:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-12-03 18:48:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-03 18:48:46,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:46,527 INFO L402 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-12-03 18:48:46,527 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:46,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 27 times [2018-12-03 18:48:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:46,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:46,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:47,466 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 18:48:47,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:47,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:47,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:47,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:47,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:47,466 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 18:48:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:47,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:47,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:47,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:47,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:47,731 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 18:48:47,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:48,956 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 18:48:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:48,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 18:48:48,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:48,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:48:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:48:48,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:48:48,977 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-12-03 18:48:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:49,171 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-12-03 18:48:49,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:48:49,172 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-12-03 18:48:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:49,173 INFO L225 Difference]: With dead ends: 305 [2018-12-03 18:48:49,173 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 18:48:49,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:48:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 18:48:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-12-03 18:48:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-03 18:48:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-12-03 18:48:49,259 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-12-03 18:48:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:49,260 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-12-03 18:48:49,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:48:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-12-03 18:48:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-03 18:48:49,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:49,261 INFO L402 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-12-03 18:48:49,262 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:49,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 28 times [2018-12-03 18:48:49,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:49,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:49,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:50,070 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 18:48:50,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:50,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:50,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:50,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:50,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:50,072 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 18:48:50,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:50,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:50,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:50,335 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 18:48:50,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:52,042 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 18:48:52,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:52,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:48:52,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:52,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:48:52,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:48:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:52,064 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-12-03 18:48:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:52,275 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-12-03 18:48:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:48:52,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-12-03 18:48:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:52,277 INFO L225 Difference]: With dead ends: 317 [2018-12-03 18:48:52,277 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 18:48:52,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 18:48:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-12-03 18:48:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-03 18:48:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-12-03 18:48:52,363 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-12-03 18:48:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:52,363 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-12-03 18:48:52,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:48:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-12-03 18:48:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-03 18:48:52,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:52,365 INFO L402 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-12-03 18:48:52,365 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:52,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 29 times [2018-12-03 18:48:52,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:52,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:52,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:54,140 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 18:48:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:54,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:54,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:54,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:54,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:54,141 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 18:48:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:54,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:54,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 146 check-sat command(s) [2018-12-03 18:48:54,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:54,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:54,635 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 18:48:54,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:55,498 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 18:48:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:55,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 18:48:55,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:55,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:48:55,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:48:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:48:55,521 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-12-03 18:48:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:55,763 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-12-03 18:48:55,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:48:55,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-12-03 18:48:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:55,765 INFO L225 Difference]: With dead ends: 329 [2018-12-03 18:48:55,765 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 18:48:55,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:48:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 18:48:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-12-03 18:48:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-03 18:48:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-12-03 18:48:55,873 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-12-03 18:48:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:55,873 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-12-03 18:48:55,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:48:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-12-03 18:48:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-03 18:48:55,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:55,875 INFO L402 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-12-03 18:48:55,875 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:55,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 30 times [2018-12-03 18:48:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:55,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:55,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:55,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:55,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:56,513 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 18:48:56,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:56,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:56,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:56,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:56,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:56,514 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 18:48:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:56,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:56,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:56,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:56,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:56,848 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 18:48:56,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:57,752 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 18:48:57,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:57,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 18:48:57,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:57,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:48:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:48:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:48:57,774 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-12-03 18:48:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:58,031 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-12-03 18:48:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:48:58,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-12-03 18:48:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:58,033 INFO L225 Difference]: With dead ends: 341 [2018-12-03 18:48:58,033 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 18:48:58,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:48:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 18:48:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-12-03 18:48:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-03 18:48:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-12-03 18:48:58,133 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-12-03 18:48:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:58,133 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-12-03 18:48:58,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:48:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-12-03 18:48:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-03 18:48:58,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:58,135 INFO L402 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-12-03 18:48:58,135 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:58,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 31 times [2018-12-03 18:48:58,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:58,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:58,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:58,948 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 18:48:58,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:58,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:58,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:58,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:58,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:58,948 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 18:48:58,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:58,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:59,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:59,250 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 18:48:59,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:00,323 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 18:49:00,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:00,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 18:49:00,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:00,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:49:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:49:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:49:00,345 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-12-03 18:49:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:00,684 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-12-03 18:49:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:49:00,685 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-12-03 18:49:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:00,686 INFO L225 Difference]: With dead ends: 353 [2018-12-03 18:49:00,686 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 18:49:00,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:49:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 18:49:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-12-03 18:49:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-03 18:49:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-12-03 18:49:00,798 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-12-03 18:49:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:00,799 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-12-03 18:49:00,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:49:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-12-03 18:49:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-03 18:49:00,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:00,801 INFO L402 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-12-03 18:49:00,801 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:00,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 32 times [2018-12-03 18:49:00,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:00,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:00,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:02,171 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 18:49:02,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:02,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:02,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:02,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:02,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:02,172 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 18:49:02,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:02,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:02,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 169 check-sat command(s) [2018-12-03 18:49:02,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:02,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:02,772 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 18:49:02,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:03,849 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 18:49:03,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 18:49:03,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:03,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:49:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:49:03,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:49:03,871 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-12-03 18:49:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:04,120 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-12-03 18:49:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:49:04,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-12-03 18:49:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:04,122 INFO L225 Difference]: With dead ends: 365 [2018-12-03 18:49:04,122 INFO L226 Difference]: Without dead ends: 363 [2018-12-03 18:49:04,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:49:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-03 18:49:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-12-03 18:49:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-03 18:49:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-12-03 18:49:04,256 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-12-03 18:49:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:04,256 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-12-03 18:49:04,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:49:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-12-03 18:49:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-12-03 18:49:04,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:04,258 INFO L402 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-12-03 18:49:04,258 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:04,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 33 times [2018-12-03 18:49:04,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:04,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:04,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:04,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:04,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:04,991 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 18:49:04,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:04,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:04,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:04,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:04,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:04,992 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 18:49:05,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:05,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:05,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:05,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:05,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:05,356 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 18:49:05,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:06,759 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 18:49:06,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 18:49:06,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:06,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:49:06,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:49:06,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:49:06,781 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-12-03 18:49:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:07,048 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-12-03 18:49:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:49:07,049 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-12-03 18:49:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:07,050 INFO L225 Difference]: With dead ends: 377 [2018-12-03 18:49:07,050 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 18:49:07,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:49:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 18:49:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-12-03 18:49:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 18:49:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-12-03 18:49:07,183 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-12-03 18:49:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:07,184 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-12-03 18:49:07,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:49:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-12-03 18:49:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-12-03 18:49:07,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:07,186 INFO L402 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-12-03 18:49:07,186 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:07,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 34 times [2018-12-03 18:49:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:07,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:07,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:08,292 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 18:49:08,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:08,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:08,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:08,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:08,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:08,293 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 18:49:08,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:08,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:08,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:08,637 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 18:49:08,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:10,563 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 18:49:10,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:10,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 18:49:10,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:10,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:49:10,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:49:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:49:10,584 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-12-03 18:49:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:10,909 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-12-03 18:49:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:49:10,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-12-03 18:49:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:10,911 INFO L225 Difference]: With dead ends: 389 [2018-12-03 18:49:10,911 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 18:49:10,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:49:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 18:49:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-12-03 18:49:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-03 18:49:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-12-03 18:49:11,033 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-12-03 18:49:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:11,034 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-12-03 18:49:11,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:49:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-12-03 18:49:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-03 18:49:11,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:11,035 INFO L402 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-12-03 18:49:11,036 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:11,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 35 times [2018-12-03 18:49:11,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:11,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:12,264 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 18:49:12,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:12,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:12,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:12,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:12,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:12,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:12,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:12,272 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:12,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 182 check-sat command(s) [2018-12-03 18:49:12,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:12,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:12,937 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 18:49:12,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:14,147 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 18:49:14,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:14,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 18:49:14,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:14,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:49:14,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:49:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:49:14,168 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-12-03 18:49:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:14,539 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-12-03 18:49:14,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:49:14,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-12-03 18:49:14,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:14,542 INFO L225 Difference]: With dead ends: 401 [2018-12-03 18:49:14,542 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 18:49:14,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:49:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 18:49:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-12-03 18:49:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-03 18:49:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-12-03 18:49:14,705 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-12-03 18:49:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:14,705 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-12-03 18:49:14,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:49:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-12-03 18:49:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-12-03 18:49:14,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:14,708 INFO L402 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-12-03 18:49:14,709 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:14,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 36 times [2018-12-03 18:49:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:14,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:14,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:14,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:14,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:15,511 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 18:49:15,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:15,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:15,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:15,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:15,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:15,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:15,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:15,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:15,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:15,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:15,845 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 18:49:15,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:17,491 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 18:49:17,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:17,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 18:49:17,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:17,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:49:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:49:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:49:17,513 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-12-03 18:49:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:17,868 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-12-03 18:49:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:49:17,868 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-12-03 18:49:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:17,870 INFO L225 Difference]: With dead ends: 413 [2018-12-03 18:49:17,870 INFO L226 Difference]: Without dead ends: 411 [2018-12-03 18:49:17,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:49:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-03 18:49:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-12-03 18:49:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-03 18:49:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-12-03 18:49:18,014 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-12-03 18:49:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:18,014 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-12-03 18:49:18,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:49:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-12-03 18:49:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-12-03 18:49:18,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:18,017 INFO L402 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-12-03 18:49:18,017 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:18,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 37 times [2018-12-03 18:49:18,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:18,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:18,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:18,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:18,832 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 18:49:18,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:18,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:18,833 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:18,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:18,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:18,833 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 18:49:18,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:18,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:19,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:19,179 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 18:49:19,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:20,601 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 18:49:20,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:20,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 18:49:20,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:20,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:49:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:49:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:49:20,626 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-12-03 18:49:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:20,954 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-12-03 18:49:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:49:20,954 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-12-03 18:49:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:20,956 INFO L225 Difference]: With dead ends: 425 [2018-12-03 18:49:20,956 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 18:49:20,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:49:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 18:49:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-12-03 18:49:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 18:49:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-12-03 18:49:21,098 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-12-03 18:49:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:21,098 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-12-03 18:49:21,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:49:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-12-03 18:49:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-12-03 18:49:21,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:21,100 INFO L402 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-12-03 18:49:21,101 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:21,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 38 times [2018-12-03 18:49:21,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:21,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:22,128 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 18:49:22,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:22,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:22,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:22,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:22,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:22,129 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 18:49:22,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:22,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:22,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 205 check-sat command(s) [2018-12-03 18:49:22,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:22,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:22,954 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 18:49:22,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:24,741 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 18:49:24,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:24,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 18:49:24,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:24,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:49:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:49:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:49:24,763 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-12-03 18:49:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:25,085 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-12-03 18:49:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:49:25,085 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-12-03 18:49:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:25,087 INFO L225 Difference]: With dead ends: 437 [2018-12-03 18:49:25,087 INFO L226 Difference]: Without dead ends: 435 [2018-12-03 18:49:25,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:49:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-03 18:49:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-12-03 18:49:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-03 18:49:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-12-03 18:49:25,258 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-12-03 18:49:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:25,259 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-12-03 18:49:25,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:49:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-12-03 18:49:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-12-03 18:49:25,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:25,261 INFO L402 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-12-03 18:49:25,262 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:25,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 39 times [2018-12-03 18:49:25,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:25,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:25,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:25,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:26,154 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 18:49:26,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:26,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:26,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:26,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:26,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:26,154 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 18:49:26,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:26,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:26,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:26,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:26,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:26,515 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 18:49:26,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:28,223 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 18:49:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 18:49:28,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:28,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:49:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:49:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:49:28,244 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-12-03 18:49:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:28,616 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-12-03 18:49:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:49:28,617 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-12-03 18:49:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:28,619 INFO L225 Difference]: With dead ends: 449 [2018-12-03 18:49:28,619 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 18:49:28,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:49:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 18:49:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-12-03 18:49:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-12-03 18:49:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-12-03 18:49:28,780 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-12-03 18:49:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:28,781 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-12-03 18:49:28,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:49:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-12-03 18:49:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-12-03 18:49:28,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:28,784 INFO L402 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-12-03 18:49:28,784 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:28,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 40 times [2018-12-03 18:49:28,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:28,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:28,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:29,606 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 18:49:29,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:29,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:29,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:29,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:29,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:29,607 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 18:49:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:29,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:29,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:30,057 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 18:49:30,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:31,964 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 18:49:31,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:31,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 18:49:31,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:31,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:49:31,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:49:31,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:49:31,986 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-12-03 18:49:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:32,375 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-12-03 18:49:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:49:32,376 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-12-03 18:49:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:32,377 INFO L225 Difference]: With dead ends: 461 [2018-12-03 18:49:32,377 INFO L226 Difference]: Without dead ends: 459 [2018-12-03 18:49:32,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:49:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-03 18:49:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-12-03 18:49:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-03 18:49:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-12-03 18:49:32,662 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-12-03 18:49:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:32,662 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-12-03 18:49:32,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:49:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-12-03 18:49:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-03 18:49:32,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:32,665 INFO L402 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-12-03 18:49:32,665 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:32,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:32,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 41 times [2018-12-03 18:49:32,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:32,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:32,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:32,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:32,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:34,053 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 18:49:34,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:34,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:34,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:34,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:34,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:34,054 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 18:49:34,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:34,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:34,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 218 check-sat command(s) [2018-12-03 18:49:34,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:34,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:35,004 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 18:49:35,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:36,698 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 18:49:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 18:49:36,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:49:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:49:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:49:36,719 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-12-03 18:49:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:37,103 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-12-03 18:49:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:49:37,104 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-12-03 18:49:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:37,106 INFO L225 Difference]: With dead ends: 473 [2018-12-03 18:49:37,106 INFO L226 Difference]: Without dead ends: 471 [2018-12-03 18:49:37,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:49:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-03 18:49:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-12-03 18:49:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 18:49:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-12-03 18:49:37,294 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-12-03 18:49:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:37,294 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-12-03 18:49:37,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:49:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-12-03 18:49:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-12-03 18:49:37,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:37,297 INFO L402 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-12-03 18:49:37,297 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:37,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 42 times [2018-12-03 18:49:37,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:37,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:37,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:37,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:37,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:38,231 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 18:49:38,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:38,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:38,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:38,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:38,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:38,232 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 18:49:38,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:38,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:38,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:38,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:38,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:38,641 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 18:49:38,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:40,404 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 18:49:40,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:40,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 18:49:40,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:40,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:49:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:49:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:49:40,427 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-12-03 18:49:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:40,828 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-12-03 18:49:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:49:40,828 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-12-03 18:49:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:40,830 INFO L225 Difference]: With dead ends: 485 [2018-12-03 18:49:40,830 INFO L226 Difference]: Without dead ends: 483 [2018-12-03 18:49:40,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:49:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-03 18:49:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-12-03 18:49:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-03 18:49:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-12-03 18:49:41,017 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-12-03 18:49:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:41,017 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-12-03 18:49:41,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:49:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-12-03 18:49:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-12-03 18:49:41,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:41,019 INFO L402 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-12-03 18:49:41,020 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:41,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 43 times [2018-12-03 18:49:41,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:41,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:41,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:42,272 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 18:49:42,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:42,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:42,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:42,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:42,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:42,272 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 18:49:42,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:42,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:42,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:42,784 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 18:49:42,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:44,678 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 18:49:44,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:44,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 18:49:44,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:44,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:49:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:49:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:49:44,700 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-12-03 18:49:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:45,265 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-12-03 18:49:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:49:45,265 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-12-03 18:49:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:45,267 INFO L225 Difference]: With dead ends: 497 [2018-12-03 18:49:45,267 INFO L226 Difference]: Without dead ends: 495 [2018-12-03 18:49:45,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:49:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-12-03 18:49:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-12-03 18:49:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-03 18:49:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-12-03 18:49:45,487 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-12-03 18:49:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:45,487 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-12-03 18:49:45,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:49:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-12-03 18:49:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-12-03 18:49:45,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:45,490 INFO L402 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-12-03 18:49:45,490 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:45,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 44 times [2018-12-03 18:49:45,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:45,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:45,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:46,714 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 18:49:46,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:46,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:46,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:46,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:46,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:46,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:46,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:46,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:47,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 241 check-sat command(s) [2018-12-03 18:49:47,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:47,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:47,808 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 18:49:47,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:49,794 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 18:49:49,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:49,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 18:49:49,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:49,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:49:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:49:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:49:49,816 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-12-03 18:49:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:50,283 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-12-03 18:49:50,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:49:50,283 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-12-03 18:49:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:50,285 INFO L225 Difference]: With dead ends: 509 [2018-12-03 18:49:50,285 INFO L226 Difference]: Without dead ends: 507 [2018-12-03 18:49:50,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:49:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-03 18:49:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-12-03 18:49:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-03 18:49:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-12-03 18:49:50,513 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-12-03 18:49:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:50,513 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-12-03 18:49:50,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:49:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-12-03 18:49:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-12-03 18:49:50,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:50,515 INFO L402 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-12-03 18:49:50,515 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:50,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:50,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 45 times [2018-12-03 18:49:50,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:50,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:50,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:51,448 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 18:49:51,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:51,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:51,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:51,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:51,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:51,449 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 18:49:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:51,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:51,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:51,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:51,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:51,890 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 18:49:51,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:54,655 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 18:49:54,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:54,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 18:49:54,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:54,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:49:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:49:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:49:54,676 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-12-03 18:49:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:55,149 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-12-03 18:49:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:49:55,150 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-12-03 18:49:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:55,151 INFO L225 Difference]: With dead ends: 521 [2018-12-03 18:49:55,152 INFO L226 Difference]: Without dead ends: 519 [2018-12-03 18:49:55,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:49:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-03 18:49:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-12-03 18:49:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-12-03 18:49:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-12-03 18:49:55,381 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-12-03 18:49:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:55,381 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-12-03 18:49:55,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:49:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-12-03 18:49:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-12-03 18:49:55,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:55,384 INFO L402 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-12-03 18:49:55,384 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:55,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 46 times [2018-12-03 18:49:55,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:55,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:55,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:56,361 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 18:49:56,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:56,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:56,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:56,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:56,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:56,362 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 18:49:56,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:56,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:56,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:56,865 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 18:49:56,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:59,314 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 18:49:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:59,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 18:49:59,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:59,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:49:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:49:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:49:59,335 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-12-03 18:50:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:00,365 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-12-03 18:50:00,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:50:00,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-12-03 18:50:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:00,369 INFO L225 Difference]: With dead ends: 533 [2018-12-03 18:50:00,369 INFO L226 Difference]: Without dead ends: 531 [2018-12-03 18:50:00,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:50:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-03 18:50:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-12-03 18:50:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 18:50:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-12-03 18:50:00,652 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-12-03 18:50:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:00,652 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-12-03 18:50:00,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:50:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-12-03 18:50:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-12-03 18:50:00,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:00,654 INFO L402 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-12-03 18:50:00,654 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:00,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 47 times [2018-12-03 18:50:00,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:00,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:00,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:01,613 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 18:50:01,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:01,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:01,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:01,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:01,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:01,614 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 18:50:01,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:01,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:02,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 254 check-sat command(s) [2018-12-03 18:50:02,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:02,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:02,805 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 18:50:02,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:05,163 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 18:50:05,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:05,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 18:50:05,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:05,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:50:05,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:50:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:50:05,185 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-12-03 18:50:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:05,864 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-12-03 18:50:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:50:05,865 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-12-03 18:50:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:05,867 INFO L225 Difference]: With dead ends: 545 [2018-12-03 18:50:05,867 INFO L226 Difference]: Without dead ends: 543 [2018-12-03 18:50:05,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 993 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:50:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-03 18:50:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-12-03 18:50:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-03 18:50:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-12-03 18:50:06,208 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-12-03 18:50:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:06,208 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-12-03 18:50:06,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:50:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-12-03 18:50:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-12-03 18:50:06,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:06,212 INFO L402 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-12-03 18:50:06,212 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:06,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 48 times [2018-12-03 18:50:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:06,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:06,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:07,378 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 18:50:07,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:07,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:07,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:07,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:07,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:07,379 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 18:50:07,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:50:07,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:50:07,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:50:07,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:07,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:07,871 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 18:50:07,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:10,261 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 18:50:10,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 18:50:10,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:10,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:50:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:50:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:50:10,284 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-12-03 18:50:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:10,917 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-12-03 18:50:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:50:10,917 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-12-03 18:50:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:10,920 INFO L225 Difference]: With dead ends: 557 [2018-12-03 18:50:10,920 INFO L226 Difference]: Without dead ends: 555 [2018-12-03 18:50:10,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:50:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-12-03 18:50:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-12-03 18:50:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-03 18:50:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-12-03 18:50:11,193 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-12-03 18:50:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:11,193 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-12-03 18:50:11,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:50:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-12-03 18:50:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-12-03 18:50:11,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:11,196 INFO L402 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-12-03 18:50:11,196 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:11,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 49 times [2018-12-03 18:50:11,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:11,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:11,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:11,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:11,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:12,321 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 18:50:12,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:12,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:12,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:12,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 18:50:12,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:12,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 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 18:50:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:12,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:50:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:12,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:12,806 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 18:50:12,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:15,285 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 18:50:15,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:15,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 18:50:15,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:15,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:50:15,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:50:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:50:15,307 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-12-03 18:50:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:15,855 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-12-03 18:50:15,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:50:15,856 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-12-03 18:50:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:15,858 INFO L225 Difference]: With dead ends: 569 [2018-12-03 18:50:15,858 INFO L226 Difference]: Without dead ends: 567 [2018-12-03 18:50:15,859 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 18:50:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-12-03 18:50:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-12-03 18:50:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-03 18:50:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-12-03 18:50:16,117 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-12-03 18:50:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:16,118 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-12-03 18:50:16,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:50:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-12-03 18:50:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-12-03 18:50:16,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:16,121 INFO L402 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-12-03 18:50:16,121 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:16,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 50 times [2018-12-03 18:50:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:16,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:17,222 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 18:50:17,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:17,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:17,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:17,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:17,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:17,223 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 18:50:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:17,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:18,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 277 check-sat command(s) [2018-12-03 18:50:18,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:18,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:18,569 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 18:50:18,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:21,102 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 18:50:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:21,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 18:50:21,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:21,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:50:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:50:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:50:21,124 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-12-03 18:50:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:21,684 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-12-03 18:50:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:50:21,684 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-12-03 18:50:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:21,686 INFO L225 Difference]: With dead ends: 581 [2018-12-03 18:50:21,687 INFO L226 Difference]: Without dead ends: 579 [2018-12-03 18:50:21,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:50:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-03 18:50:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-12-03 18:50:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-03 18:50:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-12-03 18:50:21,994 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-12-03 18:50:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:21,994 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-12-03 18:50:21,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:50:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-12-03 18:50:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-12-03 18:50:21,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:21,997 INFO L402 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-12-03 18:50:21,997 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:21,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 51 times [2018-12-03 18:50:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:21,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:21,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:23,510 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 18:50:23,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:23,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:23,511 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:23,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:23,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:23,511 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 18:50:23,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:50:23,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:50:23,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:50:23,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:23,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:24,107 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 18:50:24,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:26,770 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 18:50:26,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:26,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 18:50:26,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:26,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:50:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:50:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:50:26,793 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-12-03 18:50:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:27,387 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-12-03 18:50:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:50:27,389 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-12-03 18:50:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:27,391 INFO L225 Difference]: With dead ends: 593 [2018-12-03 18:50:27,391 INFO L226 Difference]: Without dead ends: 591 [2018-12-03 18:50:27,392 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 18:50:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-12-03 18:50:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-12-03 18:50:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-03 18:50:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-12-03 18:50:27,711 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-12-03 18:50:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:27,712 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-12-03 18:50:27,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:50:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-12-03 18:50:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-12-03 18:50:27,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:27,714 INFO L402 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-12-03 18:50:27,715 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:27,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 52 times [2018-12-03 18:50:27,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:27,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:27,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:29,154 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 18:50:29,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:29,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:29,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:29,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:29,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:29,155 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 18:50:29,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:29,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:50:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:29,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:29,669 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 18:50:29,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:32,408 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 18:50:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 18:50:32,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:32,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:50:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:50:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:50:32,430 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-12-03 18:50:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:33,064 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-12-03 18:50:33,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:50:33,064 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-12-03 18:50:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:33,066 INFO L225 Difference]: With dead ends: 605 [2018-12-03 18:50:33,067 INFO L226 Difference]: Without dead ends: 603 [2018-12-03 18:50:33,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:50:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-03 18:50:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-12-03 18:50:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-03 18:50:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-12-03 18:50:33,422 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-12-03 18:50:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:33,422 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-12-03 18:50:33,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:50:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-12-03 18:50:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-12-03 18:50:33,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:33,425 INFO L402 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-12-03 18:50:33,425 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:33,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 53 times [2018-12-03 18:50:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:33,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:33,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:34,696 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 18:50:34,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:34,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:34,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:34,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:34,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:34,697 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 18:50:34,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:34,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:35,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 290 check-sat command(s) [2018-12-03 18:50:35,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:35,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:36,172 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 18:50:36,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:39,357 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 18:50:39,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:39,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 18:50:39,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:39,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:50:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:50:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:50:39,380 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-12-03 18:50:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:40,021 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-12-03 18:50:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:50:40,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-12-03 18:50:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:40,023 INFO L225 Difference]: With dead ends: 617 [2018-12-03 18:50:40,023 INFO L226 Difference]: Without dead ends: 615 [2018-12-03 18:50:40,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:50:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-12-03 18:50:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-12-03 18:50:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-03 18:50:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-12-03 18:50:40,338 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-12-03 18:50:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:40,339 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-12-03 18:50:40,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:50:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-12-03 18:50:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-12-03 18:50:40,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:40,341 INFO L402 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-12-03 18:50:40,342 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:40,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 54 times [2018-12-03 18:50:40,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:40,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:40,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:40,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:41,626 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 18:50:41,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:41,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:41,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:41,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:41,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:41,627 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 18:50:41,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:50:41,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:50:41,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:50:41,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:41,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:42,202 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 18:50:42,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:45,532 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 18:50:45,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:45,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 18:50:45,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:45,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:50:45,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:50:45,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:50:45,554 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-12-03 18:50:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:46,233 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-12-03 18:50:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:50:46,233 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-12-03 18:50:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:46,235 INFO L225 Difference]: With dead ends: 629 [2018-12-03 18:50:46,236 INFO L226 Difference]: Without dead ends: 627 [2018-12-03 18:50:46,236 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 18:50:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-12-03 18:50:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-12-03 18:50:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-03 18:50:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-12-03 18:50:46,559 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-12-03 18:50:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:46,559 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-12-03 18:50:46,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:50:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-12-03 18:50:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-12-03 18:50:46,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:46,562 INFO L402 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-12-03 18:50:46,562 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:46,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 55 times [2018-12-03 18:50:46,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:46,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:46,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:47,896 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 18:50:47,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:47,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:47,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:47,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 18:50:47,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:47,897 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 18:50:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:47,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:50:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:48,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:48,459 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 18:50:48,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:51,745 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 18:50:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 18:50:51,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:51,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 18:50:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 18:50:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:50:51,767 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-12-03 18:50:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:52,432 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-12-03 18:50:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:50:52,432 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-12-03 18:50:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:52,434 INFO L225 Difference]: With dead ends: 641 [2018-12-03 18:50:52,435 INFO L226 Difference]: Without dead ends: 639 [2018-12-03 18:50:52,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1281 GetRequests, 1177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:50:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-03 18:50:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-12-03 18:50:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-12-03 18:50:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-12-03 18:50:52,777 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-12-03 18:50:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:52,777 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-12-03 18:50:52,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 18:50:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-12-03 18:50:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-12-03 18:50:52,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:52,780 INFO L402 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-12-03 18:50:52,780 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:52,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 56 times [2018-12-03 18:50:52,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:52,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:54,449 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 18:50:54,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:54,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:54,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:54,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:54,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:54,450 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 18:50:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:54,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:55,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 313 check-sat command(s) [2018-12-03 18:50:55,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:55,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:56,171 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 18:50:56,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:59,578 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 18:50:59,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 18:50:59,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:59,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:50:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:50:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:50:59,601 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-12-03 18:51:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:00,319 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-12-03 18:51:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:51:00,320 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-12-03 18:51:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:00,322 INFO L225 Difference]: With dead ends: 653 [2018-12-03 18:51:00,322 INFO L226 Difference]: Without dead ends: 651 [2018-12-03 18:51:00,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:51:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-03 18:51:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-12-03 18:51:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-03 18:51:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-12-03 18:51:00,679 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-12-03 18:51:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:00,679 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-12-03 18:51:00,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:51:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-12-03 18:51:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-12-03 18:51:00,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:00,682 INFO L402 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-12-03 18:51:00,682 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:00,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 57 times [2018-12-03 18:51:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:00,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:00,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:00,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:00,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:02,159 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 18:51:02,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:02,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:02,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:02,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:02,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:02,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:51:02,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:51:02,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:51:02,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:51:02,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:02,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:02,750 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 18:51:02,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:06,421 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 18:51:06,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:06,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 18:51:06,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:06,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:51:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:51:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:51:06,445 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-12-03 18:51:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:07,169 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-12-03 18:51:07,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:51:07,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-12-03 18:51:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:07,172 INFO L225 Difference]: With dead ends: 665 [2018-12-03 18:51:07,172 INFO L226 Difference]: Without dead ends: 663 [2018-12-03 18:51:07,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:51:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-12-03 18:51:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-12-03 18:51:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-03 18:51:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-12-03 18:51:07,567 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-12-03 18:51:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:07,567 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-12-03 18:51:07,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:51:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-12-03 18:51:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-12-03 18:51:07,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:07,570 INFO L402 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-12-03 18:51:07,571 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:07,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 58 times [2018-12-03 18:51:07,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:07,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:07,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:09,069 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 18:51:09,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:09,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:09,070 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:09,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:09,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:09,070 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 18:51:09,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:09,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:51:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:09,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:09,707 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 18:51:09,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:13,237 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 18:51:13,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 18:51:13,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:13,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:51:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:51:13,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:51:13,259 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-12-03 18:51:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:14,063 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-12-03 18:51:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:51:14,063 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-12-03 18:51:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:14,066 INFO L225 Difference]: With dead ends: 677 [2018-12-03 18:51:14,066 INFO L226 Difference]: Without dead ends: 675 [2018-12-03 18:51:14,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 1246 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:51:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-12-03 18:51:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-12-03 18:51:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-03 18:51:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-12-03 18:51:14,497 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-12-03 18:51:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:14,497 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-12-03 18:51:14,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:51:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-12-03 18:51:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-12-03 18:51:14,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:14,500 INFO L402 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-12-03 18:51:14,501 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:14,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 59 times [2018-12-03 18:51:14,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:14,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:14,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:16,810 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 18:51:16,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:16,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:16,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:16,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:16,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:16,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:51:16,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:51:16,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:51:18,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 326 check-sat command(s) [2018-12-03 18:51:18,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:18,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:18,687 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 18:51:18,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:22,432 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 18:51:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 18:51:22,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:22,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 18:51:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 18:51:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:51:22,454 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-12-03 18:51:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:23,237 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-12-03 18:51:23,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 18:51:23,237 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-12-03 18:51:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:23,239 INFO L225 Difference]: With dead ends: 689 [2018-12-03 18:51:23,239 INFO L226 Difference]: Without dead ends: 687 [2018-12-03 18:51:23,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1269 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:51:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-03 18:51:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-12-03 18:51:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-12-03 18:51:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-12-03 18:51:23,643 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-12-03 18:51:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:23,644 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-12-03 18:51:23,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 18:51:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-12-03 18:51:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-12-03 18:51:23,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:23,647 INFO L402 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-12-03 18:51:23,647 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:23,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 60 times [2018-12-03 18:51:23,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:23,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:23,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:23,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:23,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:25,471 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 18:51:25,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:25,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:25,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:25,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:25,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:25,471 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 18:51:25,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:51:25,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:51:25,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:51:25,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:25,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:26,122 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 18:51:26,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:30,121 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 18:51:30,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:30,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 18:51:30,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:30,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:51:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:51:30,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:51:30,144 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-12-03 18:51:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:30,968 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-12-03 18:51:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:51:30,968 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-12-03 18:51:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:30,971 INFO L225 Difference]: With dead ends: 701 [2018-12-03 18:51:30,971 INFO L226 Difference]: Without dead ends: 699 [2018-12-03 18:51:30,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1292 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:51:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-03 18:51:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-12-03 18:51:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-03 18:51:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-12-03 18:51:31,414 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-12-03 18:51:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:31,415 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-12-03 18:51:31,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:51:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-12-03 18:51:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-12-03 18:51:31,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:31,418 INFO L402 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-12-03 18:51:31,418 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:31,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 61 times [2018-12-03 18:51:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:31,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:31,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:33,062 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 18:51:33,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:33,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:33,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:33,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:33,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:33,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 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 18:51:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:33,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:51:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:33,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:33,740 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 18:51:33,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:37,954 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 18:51:37,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:37,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 18:51:37,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:37,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:51:37,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:51:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:51:37,976 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-12-03 18:51:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:38,836 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-12-03 18:51:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:51:38,836 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-12-03 18:51:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:38,839 INFO L225 Difference]: With dead ends: 713 [2018-12-03 18:51:38,839 INFO L226 Difference]: Without dead ends: 711 [2018-12-03 18:51:38,840 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 18:51:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-12-03 18:51:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-12-03 18:51:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 18:51:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-12-03 18:51:39,329 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-12-03 18:51:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:39,330 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-12-03 18:51:39,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:51:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-12-03 18:51:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-12-03 18:51:39,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:39,333 INFO L402 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-12-03 18:51:39,333 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:39,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 62 times [2018-12-03 18:51:39,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:39,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:41,347 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 18:51:41,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:41,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:41,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:41,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:41,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:41,348 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 18:51:41,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:51:41,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:51:43,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 349 check-sat command(s) [2018-12-03 18:51:43,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:43,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:43,460 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 18:51:43,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:47,690 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 18:51:47,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:47,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 18:51:47,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:47,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:51:47,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:51:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:51:47,713 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-12-03 18:51:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:48,579 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-12-03 18:51:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 18:51:48,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-12-03 18:51:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:48,582 INFO L225 Difference]: With dead ends: 725 [2018-12-03 18:51:48,582 INFO L226 Difference]: Without dead ends: 723 [2018-12-03 18:51:48,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1456 GetRequests, 1338 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:51:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-03 18:51:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-12-03 18:51:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-03 18:51:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-12-03 18:51:49,046 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-12-03 18:51:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:49,047 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-12-03 18:51:49,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:51:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-12-03 18:51:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-12-03 18:51:49,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:49,051 INFO L402 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-12-03 18:51:49,051 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:49,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 63 times [2018-12-03 18:51:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:49,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:49,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:51,184 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 18:51:51,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:51,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:51,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:51,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:51,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:51,184 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 18:51:51,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:51:51,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:51:51,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:51:51,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:51,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:51,894 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 18:51:51,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:56,404 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 18:51:56,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:56,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 18:51:56,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:56,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 18:51:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 18:51:56,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:51:56,425 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-12-03 18:51:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:57,315 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-12-03 18:51:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 18:51:57,316 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-12-03 18:51:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:57,318 INFO L225 Difference]: With dead ends: 737 [2018-12-03 18:51:57,318 INFO L226 Difference]: Without dead ends: 735 [2018-12-03 18:51:57,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1361 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:51:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-03 18:51:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-12-03 18:51:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-03 18:51:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-12-03 18:51:57,847 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-12-03 18:51:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:57,848 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-12-03 18:51:57,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 18:51:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-12-03 18:51:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-12-03 18:51:57,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:57,852 INFO L402 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-12-03 18:51:57,852 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:57,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 64 times [2018-12-03 18:51:57,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:57,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:57,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:59,733 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 18:51:59,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:59,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:59,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:59,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:59,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:59,734 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 18:51:59,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:59,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:52:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:00,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:00,434 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 18:52:00,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:04,626 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 18:52:04,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:04,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 18:52:04,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:04,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:52:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:52:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:52:04,648 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-12-03 18:52:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:05,508 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-12-03 18:52:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:52:05,508 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-12-03 18:52:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:05,511 INFO L225 Difference]: With dead ends: 749 [2018-12-03 18:52:05,511 INFO L226 Difference]: Without dead ends: 747 [2018-12-03 18:52:05,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1384 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:52:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-03 18:52:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-12-03 18:52:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-03 18:52:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-12-03 18:52:06,059 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-12-03 18:52:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:06,059 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-12-03 18:52:06,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:52:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-12-03 18:52:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-12-03 18:52:06,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:06,063 INFO L402 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-12-03 18:52:06,064 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:06,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 65 times [2018-12-03 18:52:06,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:06,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:06,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:07,937 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 18:52:07,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:07,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:07,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:07,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:07,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:07,938 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 18:52:07,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:52:07,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:52:09,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 362 check-sat command(s) [2018-12-03 18:52:09,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:09,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:10,155 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 18:52:10,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:14,863 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 18:52:14,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:14,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 18:52:14,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:14,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:52:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:52:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:52:14,886 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-12-03 18:52:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:15,909 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-12-03 18:52:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:52:15,910 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-12-03 18:52:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:15,912 INFO L225 Difference]: With dead ends: 761 [2018-12-03 18:52:15,912 INFO L226 Difference]: Without dead ends: 759 [2018-12-03 18:52:15,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1531 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:52:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-03 18:52:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-12-03 18:52:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-12-03 18:52:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-12-03 18:52:16,430 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-12-03 18:52:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:16,431 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-12-03 18:52:16,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:52:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-12-03 18:52:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-12-03 18:52:16,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:16,435 INFO L402 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-12-03 18:52:16,435 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:16,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 66 times [2018-12-03 18:52:16,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:16,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:16,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:18,337 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 18:52:18,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:18,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:18,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:18,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:18,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:18,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:52:18,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:52:18,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:52:18,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:52:18,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:18,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:19,101 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 18:52:19,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:23,879 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 18:52:23,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:23,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 18:52:23,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:23,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:52:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:52:23,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:52:23,903 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-12-03 18:52:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:25,228 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-12-03 18:52:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:52:25,228 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-12-03 18:52:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:25,231 INFO L225 Difference]: With dead ends: 773 [2018-12-03 18:52:25,231 INFO L226 Difference]: Without dead ends: 771 [2018-12-03 18:52:25,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1556 GetRequests, 1430 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:52:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-03 18:52:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-12-03 18:52:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-12-03 18:52:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-12-03 18:52:25,805 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-12-03 18:52:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:25,805 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-12-03 18:52:25,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:52:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-12-03 18:52:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-12-03 18:52:25,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:25,809 INFO L402 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-12-03 18:52:25,809 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:25,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 67 times [2018-12-03 18:52:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:25,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:25,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:28,438 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 18:52:28,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:28,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:28,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:28,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:28,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:28,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 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 18:52:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:28,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:52:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:28,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:29,217 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 18:52:29,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:34,251 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 18:52:34,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:34,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 18:52:34,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:34,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 18:52:34,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 18:52:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:52:34,273 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-12-03 18:52:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:35,274 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-12-03 18:52:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 18:52:35,275 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-12-03 18:52:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:35,277 INFO L225 Difference]: With dead ends: 785 [2018-12-03 18:52:35,277 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 18:52:35,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1581 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:52:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 18:52:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-12-03 18:52:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 18:52:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-12-03 18:52:35,845 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-12-03 18:52:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:35,845 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-12-03 18:52:35,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 18:52:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-12-03 18:52:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-12-03 18:52:35,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:35,849 INFO L402 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-12-03 18:52:35,850 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:35,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 68 times [2018-12-03 18:52:35,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:35,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:38,026 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 18:52:38,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:38,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:38,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:38,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:38,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:38,027 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 18:52:38,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:52:38,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:52:40,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 385 check-sat command(s) [2018-12-03 18:52:40,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:40,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:40,606 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 18:52:40,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:45,702 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 18:52:45,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:45,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 18:52:45,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:45,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:52:45,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:52:45,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:52:45,726 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-12-03 18:52:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:46,777 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-12-03 18:52:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:52:46,777 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-12-03 18:52:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:46,780 INFO L225 Difference]: With dead ends: 797 [2018-12-03 18:52:46,780 INFO L226 Difference]: Without dead ends: 795 [2018-12-03 18:52:46,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1606 GetRequests, 1476 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:52:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-12-03 18:52:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-12-03 18:52:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-12-03 18:52:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-12-03 18:52:47,408 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-12-03 18:52:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:47,408 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-12-03 18:52:47,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:52:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-12-03 18:52:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-12-03 18:52:47,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:47,413 INFO L402 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-12-03 18:52:47,413 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:47,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 69 times [2018-12-03 18:52:47,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:47,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:47,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:49,505 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 18:52:49,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:49,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:49,506 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:49,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:49,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:49,506 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 18:52:49,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:52:49,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:52:49,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:52:49,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:49,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:50,377 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 18:52:50,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:55,649 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 18:52:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:55,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 18:52:55,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:55,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:52:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:52:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:52:55,672 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-12-03 18:52:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:56,795 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-12-03 18:52:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:52:56,795 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-12-03 18:52:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:56,798 INFO L225 Difference]: With dead ends: 809 [2018-12-03 18:52:56,798 INFO L226 Difference]: Without dead ends: 807 [2018-12-03 18:52:56,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1631 GetRequests, 1499 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:52:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-03 18:52:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-12-03 18:52:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-12-03 18:52:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-12-03 18:52:57,406 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-12-03 18:52:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:57,407 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-12-03 18:52:57,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:52:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-12-03 18:52:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-12-03 18:52:57,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:57,411 INFO L402 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-12-03 18:52:57,411 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:57,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 70 times [2018-12-03 18:52:57,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:57,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:57,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:59,466 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 18:52:59,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:59,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:59,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:59,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:59,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:59,467 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 18:52:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:59,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:52:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:59,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:00,315 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 18:53:00,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:05,864 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 18:53:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 18:53:05,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:05,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:53:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:53:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:53:05,886 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-12-03 18:53:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:06,975 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-12-03 18:53:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:53:06,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-12-03 18:53:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:06,979 INFO L225 Difference]: With dead ends: 821 [2018-12-03 18:53:06,979 INFO L226 Difference]: Without dead ends: 819 [2018-12-03 18:53:06,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1656 GetRequests, 1522 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:53:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-03 18:53:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-12-03 18:53:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-03 18:53:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-12-03 18:53:07,657 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-12-03 18:53:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:07,658 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-12-03 18:53:07,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:53:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-12-03 18:53:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-12-03 18:53:07,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:07,662 INFO L402 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-12-03 18:53:07,662 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:07,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 71 times [2018-12-03 18:53:07,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:07,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:07,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:53:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:07,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:09,874 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 18:53:09,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:09,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:09,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:09,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:09,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:09,874 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 18:53:09,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:53:09,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:53:12,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 398 check-sat command(s) [2018-12-03 18:53:12,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:12,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:12,678 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 18:53:12,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:18,213 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 18:53:18,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:18,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 18:53:18,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:18,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 18:53:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 18:53:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:53:18,237 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-12-03 18:53:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:19,355 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-12-03 18:53:19,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:53:19,355 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-12-03 18:53:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:19,358 INFO L225 Difference]: With dead ends: 833 [2018-12-03 18:53:19,359 INFO L226 Difference]: Without dead ends: 831 [2018-12-03 18:53:19,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1681 GetRequests, 1545 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:53:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-03 18:53:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-12-03 18:53:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-12-03 18:53:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-12-03 18:53:19,997 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-12-03 18:53:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:19,998 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-12-03 18:53:19,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 18:53:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-12-03 18:53:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-12-03 18:53:20,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:20,002 INFO L402 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-12-03 18:53:20,002 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:20,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 72 times [2018-12-03 18:53:20,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:20,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:20,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:53:20,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:20,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:22,253 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 18:53:22,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:22,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:22,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:22,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:22,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:22,253 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 18:53:22,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:53:22,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:53:22,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:53:22,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:22,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:23,131 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 18:53:23,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:28,767 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 18:53:28,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 18:53:28,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:28,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:53:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:53:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:53:28,790 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-12-03 18:53:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:30,005 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-12-03 18:53:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 18:53:30,006 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-12-03 18:53:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:30,009 INFO L225 Difference]: With dead ends: 845 [2018-12-03 18:53:30,009 INFO L226 Difference]: Without dead ends: 843 [2018-12-03 18:53:30,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:53:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-12-03 18:53:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-12-03 18:53:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-12-03 18:53:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-12-03 18:53:30,738 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-12-03 18:53:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:30,738 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-12-03 18:53:30,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:53:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-12-03 18:53:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-12-03 18:53:30,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:30,743 INFO L402 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-12-03 18:53:30,743 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:30,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:30,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 73 times [2018-12-03 18:53:30,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:30,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:53:30,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:30,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:33,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 18:53:33,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:33,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:33,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:33,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:33,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:33,315 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 18:53:33,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:53:33,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:53:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:33,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:34,184 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 18:53:34,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:40,108 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 18:53:40,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:40,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 18:53:40,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:40,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 18:53:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 18:53:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:53:40,131 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-12-03 18:53:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:41,420 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-12-03 18:53:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 18:53:41,420 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-12-03 18:53:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:41,423 INFO L225 Difference]: With dead ends: 857 [2018-12-03 18:53:41,423 INFO L226 Difference]: Without dead ends: 855 [2018-12-03 18:53:41,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1591 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:53:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-03 18:53:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-12-03 18:53:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-03 18:53:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-12-03 18:53:42,126 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-12-03 18:53:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:42,126 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-12-03 18:53:42,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 18:53:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-12-03 18:53:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-12-03 18:53:42,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:42,131 INFO L402 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-12-03 18:53:42,131 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:42,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 74 times [2018-12-03 18:53:42,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:53:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:42,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:44,752 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 18:53:44,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:44,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:44,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:44,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:44,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:44,753 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 18:53:44,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:53:44,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:53:47,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 421 check-sat command(s) [2018-12-03 18:53:47,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:47,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:47,792 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 18:53:47,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:53,827 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 18:53:53,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:53,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 18:53:53,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:53,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 18:53:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 18:53:53,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:53:53,851 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-12-03 18:53:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:55,117 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-12-03 18:53:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 18:53:55,117 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-12-03 18:53:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:55,119 INFO L225 Difference]: With dead ends: 869 [2018-12-03 18:53:55,119 INFO L226 Difference]: Without dead ends: 867 [2018-12-03 18:53:55,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1614 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:53:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-03 18:53:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-12-03 18:53:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-03 18:53:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-12-03 18:53:55,899 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-12-03 18:53:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:55,900 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-12-03 18:53:55,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 18:53:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-12-03 18:53:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-12-03 18:53:55,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:55,905 INFO L402 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-12-03 18:53:55,906 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:55,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 75 times [2018-12-03 18:53:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:55,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:55,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:53:55,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:55,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:58,576 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 18:53:58,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:58,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:58,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:58,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:58,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:58,577 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 18:53:58,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:53:58,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:53:59,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:53:59,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:59,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:59,544 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 18:53:59,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:05,648 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 18:54:05,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:05,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 18:54:05,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:05,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 18:54:05,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 18:54:05,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 18:54:05,673 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-12-03 18:54:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:07,012 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-12-03 18:54:07,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 18:54:07,013 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-12-03 18:54:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:07,014 INFO L225 Difference]: With dead ends: 881 [2018-12-03 18:54:07,014 INFO L226 Difference]: Without dead ends: 879 [2018-12-03 18:54:07,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1637 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 18:54:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-03 18:54:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-12-03 18:54:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-12-03 18:54:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-12-03 18:54:07,752 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-12-03 18:54:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-12-03 18:54:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 18:54:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-12-03 18:54:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-12-03 18:54:07,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:07,758 INFO L402 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-12-03 18:54:07,758 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:07,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 76 times [2018-12-03 18:54:07,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:07,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:54:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:07,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:10,681 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 18:54:10,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:10,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:10,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:10,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:10,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:10,682 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 18:54:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:10,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:54:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:11,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:11,670 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 18:54:11,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:18,084 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 18:54:18,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:18,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 18:54:18,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:18,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 18:54:18,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 18:54:18,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:54:18,108 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-12-03 18:54:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:19,464 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-12-03 18:54:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 18:54:19,465 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-12-03 18:54:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:19,466 INFO L225 Difference]: With dead ends: 893 [2018-12-03 18:54:19,466 INFO L226 Difference]: Without dead ends: 891 [2018-12-03 18:54:19,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1806 GetRequests, 1660 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:54:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-03 18:54:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-12-03 18:54:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-12-03 18:54:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-12-03 18:54:20,294 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-12-03 18:54:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:20,295 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-12-03 18:54:20,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 18:54:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-12-03 18:54:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-12-03 18:54:20,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:20,300 INFO L402 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-12-03 18:54:20,300 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:20,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 77 times [2018-12-03 18:54:20,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:20,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:22,928 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 18:54:22,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:22,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:22,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:22,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:22,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:22,929 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 18:54:22,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:54:22,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:54:25,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 434 check-sat command(s) [2018-12-03 18:54:25,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:54:25,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:26,224 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 18:54:26,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:32,873 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 18:54:32,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 18:54:32,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:32,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 18:54:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 18:54:32,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 18:54:32,898 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-12-03 18:54:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:34,242 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-12-03 18:54:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 18:54:34,242 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-12-03 18:54:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:34,243 INFO L225 Difference]: With dead ends: 905 [2018-12-03 18:54:34,243 INFO L226 Difference]: Without dead ends: 903 [2018-12-03 18:54:34,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1831 GetRequests, 1683 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 18:54:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-03 18:54:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-12-03 18:54:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-03 18:54:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-12-03 18:54:35,049 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-12-03 18:54:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:35,049 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-12-03 18:54:35,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 18:54:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-12-03 18:54:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-12-03 18:54:35,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:35,056 INFO L402 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-12-03 18:54:35,057 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:35,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:35,057 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 78 times [2018-12-03 18:54:35,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:35,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:54:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:35,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:37,721 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 18:54:37,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:37,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:37,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:37,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:37,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:37,722 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 18:54:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:54:37,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:54:38,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:54:38,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:54:38,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:38,643 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 18:54:38,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:45,660 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 18:54:45,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:45,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 18:54:45,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:45,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 18:54:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 18:54:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 18:54:45,684 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-12-03 18:54:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:47,160 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-12-03 18:54:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 18:54:47,160 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-12-03 18:54:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:47,162 INFO L225 Difference]: With dead ends: 917 [2018-12-03 18:54:47,162 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 18:54:47,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1856 GetRequests, 1706 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 18:54:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 18:54:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-12-03 18:54:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 18:54:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-12-03 18:54:48,009 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-12-03 18:54:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:48,010 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-12-03 18:54:48,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 18:54:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-12-03 18:54:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-12-03 18:54:48,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:48,016 INFO L402 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-12-03 18:54:48,016 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:48,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 79 times [2018-12-03 18:54:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:48,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:54:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:48,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:51,003 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 18:54:51,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:51,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:51,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:51,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:51,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:51,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:54:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:51,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:54:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:51,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:51,953 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 18:54:51,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:58,774 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 18:54:58,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 18:54:58,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:58,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 18:54:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 18:54:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:54:58,826 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-12-03 18:55:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:00,193 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-12-03 18:55:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 18:55:00,194 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-12-03 18:55:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:00,195 INFO L225 Difference]: With dead ends: 929 [2018-12-03 18:55:00,195 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 18:55:00,196 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 18:55:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 18:55:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-12-03 18:55:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-03 18:55:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-12-03 18:55:01,079 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-12-03 18:55:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:01,080 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-12-03 18:55:01,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 18:55:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-12-03 18:55:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-12-03 18:55:01,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:01,086 INFO L402 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-12-03 18:55:01,086 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:01,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 80 times [2018-12-03 18:55:01,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:01,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:55:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:01,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:03,983 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 18:55:03,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:03,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:03,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:03,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:03,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:03,984 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 18:55:03,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:55:03,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:55:07,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 457 check-sat command(s) [2018-12-03 18:55:07,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:55:07,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:07,594 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 18:55:07,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:14,736 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 18:55:14,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:14,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 18:55:14,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:14,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:55:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:55:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 18:55:14,760 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-12-03 18:55:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:16,304 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-12-03 18:55:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 18:55:16,304 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-12-03 18:55:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:16,305 INFO L225 Difference]: With dead ends: 941 [2018-12-03 18:55:16,305 INFO L226 Difference]: Without dead ends: 939 [2018-12-03 18:55:16,306 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 18:55:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-12-03 18:55:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-12-03 18:55:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-12-03 18:55:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-12-03 18:55:17,148 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-12-03 18:55:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:17,149 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-12-03 18:55:17,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:55:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-12-03 18:55:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-12-03 18:55:17,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:17,155 INFO L402 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-12-03 18:55:17,155 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:17,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 81 times [2018-12-03 18:55:17,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:17,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:55:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:17,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:20,143 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 18:55:20,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:20,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:20,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:20,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:20,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:20,144 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 18:55:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:55:20,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:55:20,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:55:20,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:55:20,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:21,202 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 18:55:21,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:28,527 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 18:55:28,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:28,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 18:55:28,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:28,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 18:55:28,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 18:55:28,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 18:55:28,551 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-12-03 18:55:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:30,198 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-12-03 18:55:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 18:55:30,198 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-12-03 18:55:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:30,200 INFO L225 Difference]: With dead ends: 953 [2018-12-03 18:55:30,200 INFO L226 Difference]: Without dead ends: 951 [2018-12-03 18:55:30,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1775 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 18:55:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-03 18:55:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-12-03 18:55:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-03 18:55:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-12-03 18:55:31,209 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-12-03 18:55:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:31,210 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-12-03 18:55:31,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 18:55:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-12-03 18:55:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-12-03 18:55:31,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:31,218 INFO L402 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-12-03 18:55:31,218 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:31,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 82 times [2018-12-03 18:55:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:31,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:55:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:31,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:34,168 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 18:55:34,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:34,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:34,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:34,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:34,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:34,169 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 18:55:34,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:55:34,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:55:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:34,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:35,254 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 18:55:35,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:42,695 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 18:55:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 18:55:42,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:42,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 18:55:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 18:55:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:55:42,717 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-12-03 18:55:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:44,341 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-12-03 18:55:44,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 18:55:44,341 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-12-03 18:55:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:44,343 INFO L225 Difference]: With dead ends: 965 [2018-12-03 18:55:44,343 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 18:55:44,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1956 GetRequests, 1798 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:55:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 18:55:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-12-03 18:55:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-03 18:55:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-12-03 18:55:45,247 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-12-03 18:55:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:45,247 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-12-03 18:55:45,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 18:55:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-12-03 18:55:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-12-03 18:55:45,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:45,255 INFO L402 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-12-03 18:55:45,256 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:45,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 83 times [2018-12-03 18:55:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:45,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:55:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:45,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:48,466 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 18:55:48,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:48,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:48,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:48,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:48,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:48,466 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 18:55:48,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:55:48,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:55:51,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 470 check-sat command(s) [2018-12-03 18:55:51,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:55:51,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:52,394 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 18:55:52,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:00,089 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 18:56:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 18:56:00,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:00,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 18:56:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 18:56:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:56:00,113 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-12-03 18:56:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:01,708 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-12-03 18:56:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 18:56:01,708 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-12-03 18:56:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:01,710 INFO L225 Difference]: With dead ends: 977 [2018-12-03 18:56:01,710 INFO L226 Difference]: Without dead ends: 975 [2018-12-03 18:56:01,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1981 GetRequests, 1821 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:56:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-03 18:56:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-12-03 18:56:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-03 18:56:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-12-03 18:56:02,789 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-12-03 18:56:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:02,789 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-12-03 18:56:02,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 18:56:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-12-03 18:56:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-12-03 18:56:02,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:02,796 INFO L402 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-12-03 18:56:02,796 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:02,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 84 times [2018-12-03 18:56:02,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:02,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:02,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:05,940 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 18:56:05,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:05,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:05,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:05,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:05,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:05,941 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 18:56:05,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:05,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:06,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:06,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:06,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:07,023 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 18:56:07,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:14,773 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 18:56:14,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:14,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 18:56:14,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:14,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 18:56:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 18:56:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 18:56:14,797 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-12-03 18:56:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:16,441 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-12-03 18:56:16,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 18:56:16,441 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-12-03 18:56:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:16,444 INFO L225 Difference]: With dead ends: 989 [2018-12-03 18:56:16,444 INFO L226 Difference]: Without dead ends: 987 [2018-12-03 18:56:16,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2006 GetRequests, 1844 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 18:56:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-12-03 18:56:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-12-03 18:56:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-12-03 18:56:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-12-03 18:56:17,558 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-12-03 18:56:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:17,559 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-12-03 18:56:17,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 18:56:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-12-03 18:56:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-12-03 18:56:17,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:17,566 INFO L402 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-12-03 18:56:17,566 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:17,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 85 times [2018-12-03 18:56:17,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:17,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:17,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:17,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:17,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:20,678 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 18:56:20,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:20,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:20,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:20,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:20,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:20,679 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 18:56:20,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:20,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:21,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:21,834 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 18:56:21,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:29,696 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 18:56:29,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:29,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 18:56:29,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:29,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 18:56:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 18:56:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:56:29,719 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-12-03 18:56:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:31,362 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-12-03 18:56:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 18:56:31,363 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-12-03 18:56:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:31,364 INFO L225 Difference]: With dead ends: 1001 [2018-12-03 18:56:31,364 INFO L226 Difference]: Without dead ends: 999 [2018-12-03 18:56:31,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1867 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:56:31,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-12-03 18:56:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-12-03 18:56:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-12-03 18:56:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-12-03 18:56:32,414 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-12-03 18:56:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:32,414 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-12-03 18:56:32,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 18:56:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-12-03 18:56:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-12-03 18:56:32,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:32,420 INFO L402 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-12-03 18:56:32,420 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:32,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:32,420 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 86 times [2018-12-03 18:56:32,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:32,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:32,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:32,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:32,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:35,722 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 18:56:35,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:35,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:35,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:35,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:35,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:35,723 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 18:56:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:35,733 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:39,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 493 check-sat command(s) [2018-12-03 18:56:39,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:39,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:40,058 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 18:56:40,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:48,541 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 18:56:48,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:48,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 18:56:48,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:48,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:56:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:56:48,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 18:56:48,564 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-12-03 18:56:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:50,243 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-12-03 18:56:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 18:56:50,244 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-12-03 18:56:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:50,246 INFO L225 Difference]: With dead ends: 1013 [2018-12-03 18:56:50,247 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 18:56:50,248 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 18:56:50,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 18:56:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-12-03 18:56:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 18:56:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-12-03 18:56:51,385 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-12-03 18:56:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:51,386 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-12-03 18:56:51,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:56:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-12-03 18:56:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-12-03 18:56:51,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:51,392 INFO L402 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-12-03 18:56:51,392 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:51,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:51,393 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 87 times [2018-12-03 18:56:51,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:51,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:51,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:54,874 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 18:56:54,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:54,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:54,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:54,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:54,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:54,874 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 18:56:54,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:54,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:55,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:55,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:55,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:56,100 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 18:56:56,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:04,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 18:57:04,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:04,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 18:57:04,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:04,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 18:57:04,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 18:57:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 18:57:04,720 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-12-03 18:57:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:06,484 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-12-03 18:57:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 18:57:06,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-12-03 18:57:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:06,486 INFO L225 Difference]: With dead ends: 1025 [2018-12-03 18:57:06,486 INFO L226 Difference]: Without dead ends: 1023 [2018-12-03 18:57:06,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2081 GetRequests, 1913 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 18:57:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-12-03 18:57:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-12-03 18:57:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-03 18:57:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-12-03 18:57:07,644 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-12-03 18:57:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:07,644 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-12-03 18:57:07,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 18:57:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-12-03 18:57:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-12-03 18:57:07,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:07,651 INFO L402 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-12-03 18:57:07,651 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:07,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 88 times [2018-12-03 18:57:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:07,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:07,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:11,117 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 18:57:11,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:11,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:11,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:11,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:11,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:11,118 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 18:57:11,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:11,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:11,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:12,310 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 18:57:12,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:21,295 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 18:57:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:21,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 18:57:21,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 18:57:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 18:57:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:57:21,320 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-12-03 18:57:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:23,143 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-12-03 18:57:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 18:57:23,144 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-12-03 18:57:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:23,145 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 18:57:23,145 INFO L226 Difference]: Without dead ends: 1035 [2018-12-03 18:57:23,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2106 GetRequests, 1936 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:57:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-03 18:57:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-12-03 18:57:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-12-03 18:57:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-12-03 18:57:24,482 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-12-03 18:57:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:24,483 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-12-03 18:57:24,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 18:57:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-12-03 18:57:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-12-03 18:57:24,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:24,489 INFO L402 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-12-03 18:57:24,489 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:24,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 89 times [2018-12-03 18:57:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:24,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:27,932 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 18:57:27,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:27,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:27,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:27,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:27,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:27,933 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 18:57:27,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:27,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:32,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 506 check-sat command(s) [2018-12-03 18:57:32,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:32,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:32,818 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 18:57:32,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:41,602 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 18:57:41,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 18:57:41,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:41,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 18:57:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 18:57:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 18:57:41,626 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-12-03 18:57:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:43,456 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-12-03 18:57:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:57:43,456 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-12-03 18:57:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:43,457 INFO L225 Difference]: With dead ends: 1049 [2018-12-03 18:57:43,457 INFO L226 Difference]: Without dead ends: 1047 [2018-12-03 18:57:43,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 1959 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 18:57:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-12-03 18:57:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-12-03 18:57:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-03 18:57:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-12-03 18:57:44,623 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-12-03 18:57:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-12-03 18:57:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 18:57:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-12-03 18:57:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-12-03 18:57:44,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:44,630 INFO L402 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-12-03 18:57:44,630 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:44,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 90 times [2018-12-03 18:57:44,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:44,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:44,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:44,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:44,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:48,124 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 18:57:48,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:48,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:48,125 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:48,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:48,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:48,125 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 18:57:48,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:48,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:48,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:48,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:48,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:49,370 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 18:57:49,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:58,397 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 18:57:58,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:58,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 18:57:58,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:58,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 18:57:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 18:57:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 18:57:58,419 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-12-03 18:58:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:00,331 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-12-03 18:58:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 18:58:00,332 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-12-03 18:58:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:00,333 INFO L225 Difference]: With dead ends: 1061 [2018-12-03 18:58:00,333 INFO L226 Difference]: Without dead ends: 1059 [2018-12-03 18:58:00,334 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 18:58:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-12-03 18:58:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-12-03 18:58:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-12-03 18:58:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-12-03 18:58:01,543 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-12-03 18:58:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:01,544 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-12-03 18:58:01,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 18:58:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-12-03 18:58:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-12-03 18:58:01,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:01,550 INFO L402 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-12-03 18:58:01,550 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:01,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:01,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 91 times [2018-12-03 18:58:01,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:01,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:01,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:01,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:01,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:05,482 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 18:58:05,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:05,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:05,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:05,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:05,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:05,483 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 18:58:05,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:05,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:58:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:06,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:06,757 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 18:58:06,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:16,076 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 18:58:16,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:16,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 18:58:16,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:16,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 18:58:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 18:58:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:58:16,099 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-12-03 18:58:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:17,989 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-12-03 18:58:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 18:58:17,989 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-12-03 18:58:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:17,991 INFO L225 Difference]: With dead ends: 1073 [2018-12-03 18:58:17,991 INFO L226 Difference]: Without dead ends: 1071 [2018-12-03 18:58:17,992 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 18:58:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-12-03 18:58:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-12-03 18:58:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-12-03 18:58:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-12-03 18:58:19,281 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-12-03 18:58:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:19,281 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-12-03 18:58:19,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 18:58:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-12-03 18:58:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-12-03 18:58:19,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:19,288 INFO L402 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-12-03 18:58:19,288 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:19,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 92 times [2018-12-03 18:58:19,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:19,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:19,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:19,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:19,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:23,040 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 18:58:23,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:23,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:23,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:23,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:23,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:23,041 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 18:58:23,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:23,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:27,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 529 check-sat command(s) [2018-12-03 18:58:27,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:27,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:27,991 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 18:58:27,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:37,504 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 18:58:37,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:37,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 18:58:37,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 18:58:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 18:58:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 18:58:37,529 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-12-03 18:58:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:39,437 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-12-03 18:58:39,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 18:58:39,438 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-12-03 18:58:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:39,439 INFO L225 Difference]: With dead ends: 1085 [2018-12-03 18:58:39,439 INFO L226 Difference]: Without dead ends: 1083 [2018-12-03 18:58:39,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2206 GetRequests, 2028 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 18:58:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-12-03 18:58:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-12-03 18:58:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-12-03 18:58:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-12-03 18:58:40,667 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-12-03 18:58:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:40,667 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-12-03 18:58:40,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 18:58:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-12-03 18:58:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-12-03 18:58:40,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:40,675 INFO L402 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-12-03 18:58:40,675 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:40,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:40,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 93 times [2018-12-03 18:58:40,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:40,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:40,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:44,467 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 18:58:44,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:44,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:44,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:44,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:44,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:44,468 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 18:58:44,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:58:44,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:58:45,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:58:45,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:45,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:45,780 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 18:58:45,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:55,911 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 18:58:55,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:55,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 18:58:55,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:55,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 18:58:55,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 18:58:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 18:58:55,934 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-12-03 18:58:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:57,943 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-12-03 18:58:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 18:58:57,943 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-12-03 18:58:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:57,945 INFO L225 Difference]: With dead ends: 1097 [2018-12-03 18:58:57,945 INFO L226 Difference]: Without dead ends: 1095 [2018-12-03 18:58:57,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2231 GetRequests, 2051 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 18:58:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-12-03 18:58:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-12-03 18:58:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-12-03 18:58:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-12-03 18:58:59,206 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-12-03 18:58:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:59,207 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-12-03 18:58:59,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 18:58:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-12-03 18:58:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-12-03 18:58:59,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:59,213 INFO L402 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-12-03 18:58:59,213 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:59,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 94 times [2018-12-03 18:58:59,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:59,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:59,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:03,391 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 18:59:03,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:03,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:03,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:03,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:03,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:03,392 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 18:59:03,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:03,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:03,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:04,778 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 18:59:04,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:14,796 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 18:59:14,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:14,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 18:59:14,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:14,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 18:59:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 18:59:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:59:14,819 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-12-03 18:59:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:16,814 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-12-03 18:59:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 18:59:16,814 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-12-03 18:59:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:16,815 INFO L225 Difference]: With dead ends: 1109 [2018-12-03 18:59:16,815 INFO L226 Difference]: Without dead ends: 1107 [2018-12-03 18:59:16,816 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 18:59:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-12-03 18:59:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-12-03 18:59:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-12-03 18:59:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-12-03 18:59:18,079 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-12-03 18:59:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:18,079 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-12-03 18:59:18,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 18:59:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-12-03 18:59:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-12-03 18:59:18,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:18,087 INFO L402 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-12-03 18:59:18,087 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:18,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 95 times [2018-12-03 18:59:18,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:18,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:18,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:22,276 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 18:59:22,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:22,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:22,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:22,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:22,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:22,277 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 18:59:22,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:59:22,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:59:26,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 542 check-sat command(s) [2018-12-03 18:59:26,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:26,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:27,546 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 18:59:27,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:37,690 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 18:59:37,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:37,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 18:59:37,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:37,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 18:59:37,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 18:59:37,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 18:59:37,715 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-12-03 18:59:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:39,872 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-12-03 18:59:39,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:59:39,872 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-12-03 18:59:39,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:39,873 INFO L225 Difference]: With dead ends: 1121 [2018-12-03 18:59:39,873 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 18:59:39,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2281 GetRequests, 2097 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 18:59:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 18:59:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-12-03 18:59:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-12-03 18:59:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-12-03 18:59:41,268 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-12-03 18:59:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:41,268 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-12-03 18:59:41,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 18:59:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-12-03 18:59:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-12-03 18:59:41,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:41,276 INFO L402 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-12-03 18:59:41,276 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:41,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:41,277 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 96 times [2018-12-03 18:59:41,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:41,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:41,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:45,314 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 18:59:45,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:45,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:45,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:45,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:45,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:45,315 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 18:59:45,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:59:45,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:59:45,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:59:45,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:45,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:46,759 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 18:59:46,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:56,892 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 18:59:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:56,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 18:59:56,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:56,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 18:59:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 18:59:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 18:59:56,917 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-12-03 18:59:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:59,071 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-12-03 18:59:59,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 18:59:59,072 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-12-03 18:59:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:59,073 INFO L225 Difference]: With dead ends: 1133 [2018-12-03 18:59:59,073 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 18:59:59,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2306 GetRequests, 2120 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 18:59:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 19:00:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-12-03 19:00:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-12-03 19:00:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-12-03 19:00:00,546 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-12-03 19:00:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:00,547 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-12-03 19:00:00,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 19:00:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-12-03 19:00:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-12-03 19:00:00,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:00,555 INFO L402 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-12-03 19:00:00,555 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:00,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 97 times [2018-12-03 19:00:00,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:00,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:00:00,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:00,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:04,971 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 19:00:04,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:04,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:04,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:04,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:04,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:04,971 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 19:00:04,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:04,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:00:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:05,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:06,402 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 19:00:06,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:17,052 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 19:00:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:17,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 19:00:17,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:17,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 19:00:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 19:00:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:00:17,076 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-12-03 19:00:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:19,264 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-12-03 19:00:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 19:00:19,265 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-12-03 19:00:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:19,266 INFO L225 Difference]: With dead ends: 1145 [2018-12-03 19:00:19,266 INFO L226 Difference]: Without dead ends: 1143 [2018-12-03 19:00:19,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2331 GetRequests, 2143 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:00:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-12-03 19:00:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-12-03 19:00:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 19:00:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-12-03 19:00:20,775 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-12-03 19:00:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:20,776 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-12-03 19:00:20,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 19:00:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-12-03 19:00:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-12-03 19:00:20,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:20,784 INFO L402 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-12-03 19:00:20,784 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:20,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 98 times [2018-12-03 19:00:20,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:20,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:20,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:25,288 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 19:00:25,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:25,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:25,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:25,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:25,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:25,288 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 19:00:25,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:00:25,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:00:30,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 565 check-sat command(s) [2018-12-03 19:00:30,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:30,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:31,158 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 19:00:31,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:41,857 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 19:00:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 19:00:41,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:41,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 19:00:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 19:00:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:00:41,882 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-12-03 19:00:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:44,002 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-12-03 19:00:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 19:00:44,002 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-12-03 19:00:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:44,004 INFO L225 Difference]: With dead ends: 1157 [2018-12-03 19:00:44,004 INFO L226 Difference]: Without dead ends: 1155 [2018-12-03 19:00:44,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2356 GetRequests, 2166 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:00:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-03 19:00:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-12-03 19:00:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-12-03 19:00:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-12-03 19:00:45,550 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-12-03 19:00:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:45,551 INFO L480 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-12-03 19:00:45,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 19:00:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-12-03 19:00:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-12-03 19:00:45,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:45,560 INFO L402 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-12-03 19:00:45,561 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:45,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 99 times [2018-12-03 19:00:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:45,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:00:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:45,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:50,133 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 19:00:50,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:50,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:50,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:50,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 19:00:50,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:50,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 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 19:00:50,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:00:50,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:00:50,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:00:50,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:50,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:51,611 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 19:00:51,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:02,544 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 19:01:02,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:02,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 19:01:02,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:02,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 19:01:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 19:01:02,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:01:02,569 INFO L87 Difference]: Start difference. First operand 1144 states and 1239 transitions. Second operand 98 states.