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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:02,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:02,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:02,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:02,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:02,862 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:02,863 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:02,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:02,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:02,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:02,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:02,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:02,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:02,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:02,872 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:02,873 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:02,874 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:02,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:02,878 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:02,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:02,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:02,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:02,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:02,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:02,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:02,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:02,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:02,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:02,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:02,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:02,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:02,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:02,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:02,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:02,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:02,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:02,894 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 [2019-03-04 16:53:02,907 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:02,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:02,908 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:02,908 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:02,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:02,908 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:02,909 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:02,909 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:02,909 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:02,909 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:02,909 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:02,910 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:02,910 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:02,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:02,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:02,911 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:02,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:02,911 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:02,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:02,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:02,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:02,912 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:02,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:02,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:02,913 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:02,913 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:02,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:02,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:02,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:02,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:02,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:02,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:02,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:02,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:02,915 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:02,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:02,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:02,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:02,916 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:02,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:02,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:02,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:02,978 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:02,978 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:02,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-03-04 16:53:02,980 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-03-04 16:53:03,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:03,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:03,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:03,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:03,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:03,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,073 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:53:03,073 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:53:03,073 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:53:03,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:03,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:03,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:03,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:03,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... [2019-03-04 16:53:03,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:03,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:03,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:03,115 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:03,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:53:03,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:53:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-03-04 16:53:03,464 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:53:03,465 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-03-04 16:53:03,466 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:03 BoogieIcfgContainer [2019-03-04 16:53:03,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:03,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:03,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:03,471 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:03,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:03" (1/2) ... [2019-03-04 16:53:03,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3dd93e and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:03, skipping insertion in model container [2019-03-04 16:53:03,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:03" (2/2) ... [2019-03-04 16:53:03,475 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-03-04 16:53:03,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:03,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:53:03,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:53:03,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:03,548 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:03,548 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:03,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:03,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:03,549 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:03,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:03,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:53:03,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:03,577 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:03,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-03-04 16:53:03,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:03,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:03,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:03,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:03,872 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:53:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:04,001 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-03-04 16:53:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:04,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:04,016 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:53:04,016 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:53:04,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:53:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-03-04 16:53:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:53:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:53:04,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-03-04 16:53:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:04,056 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:53:04,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:53:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:53:04,057 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:04,057 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:53:04,058 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-03-04 16:53:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:04,176 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:53:04,178 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2019-03-04 16:53:04,239 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:04,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:11,022 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:11,023 INFO L272 AbstractInterpreter]: Visited 5 different actions 38 times. Merged at 4 different actions 33 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:53:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:11,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:11,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:11,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:11,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:11,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:53:11,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:11,225 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:11,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:11,248 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:11,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:11,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:11,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:11,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:53:11,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:11,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:11,466 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-03-04 16:53:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:11,553 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:53:11,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:11,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-03-04 16:53:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:11,555 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:53:11,555 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:53:11,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:53:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-03-04 16:53:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:53:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-03-04 16:53:11,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-03-04 16:53:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:11,559 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-03-04 16:53:11,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-03-04 16:53:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:53:11,560 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:11,561 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-03-04 16:53:11,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-03-04 16:53:11,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:11,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:11,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:11,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:11,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:11,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:11,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:11,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:11,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:11,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:11,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:11,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:53:11,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:11,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:53:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:11,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:11,881 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:11,978 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:11,979 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:12,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:53:12,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:12,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:53:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:53:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:12,298 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-03-04 16:53:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:12,434 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-03-04 16:53:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:12,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:53:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:12,436 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:53:12,437 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:53:12,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:53:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:53:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:53:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-03-04 16:53:12,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-03-04 16:53:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:12,442 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-03-04 16:53:12,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:53:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-03-04 16:53:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-03-04 16:53:12,442 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:12,443 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-03-04 16:53:12,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:12,443 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-03-04 16:53:12,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:12,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:12,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:12,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:12,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:12,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:12,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:12,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:12,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:12,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:12,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:12,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:12,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:53:12,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:12,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:12,607 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:12,623 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:12,623 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:12,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:53:12,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:12,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:53:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:53:12,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:12,867 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-03-04 16:53:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:13,218 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-03-04 16:53:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:13,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-03-04 16:53:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:13,220 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:53:13,220 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:53:13,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:53:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-03-04 16:53:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:53:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-03-04 16:53:13,224 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-03-04 16:53:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:13,225 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-03-04 16:53:13,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:53:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-03-04 16:53:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-03-04 16:53:13,225 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:13,226 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-03-04 16:53:13,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:13,226 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-03-04 16:53:13,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:13,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:13,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:13,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:13,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:13,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:13,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:13,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:13,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:13,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:53:13,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:13,444 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:13,445 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:13,453 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:13,454 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:13,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:13,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:13,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:53:13,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:13,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:53:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:53:13,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:13,727 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-03-04 16:53:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:13,783 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-03-04 16:53:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:13,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-03-04 16:53:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:13,786 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:53:13,786 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:53:13,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:53:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-03-04 16:53:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:53:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-03-04 16:53:13,792 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-03-04 16:53:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-03-04 16:53:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:53:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-03-04 16:53:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-03-04 16:53:13,793 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:13,793 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-03-04 16:53:13,793 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-03-04 16:53:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:13,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:13,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:13,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:13,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:13,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:13,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:13,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:13,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:13,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-03-04 16:53:13,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:13,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 25 conjunts are in the unsatisfiable core [2019-03-04 16:53:13,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:13,936 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:13,937 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:13,953 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:13,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:14,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:53:14,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:14,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:53:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:53:14,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:53:14,395 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-03-04 16:53:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:14,448 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-03-04 16:53:14,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:14,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-03-04 16:53:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:14,450 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:53:14,450 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:53:14,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:53:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:53:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-03-04 16:53:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:53:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-03-04 16:53:14,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-03-04 16:53:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:14,456 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-03-04 16:53:14,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:53:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-03-04 16:53:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-03-04 16:53:14,457 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:14,457 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-03-04 16:53:14,457 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:14,457 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-03-04 16:53:14,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:14,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:14,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:14,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:14,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:14,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:14,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:14,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:14,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:14,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:53:14,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:14,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:14,631 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:14,641 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:14,642 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:14,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-03-04 16:53:14,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:14,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:53:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:53:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:53:14,856 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-03-04 16:53:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:14,941 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-03-04 16:53:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:53:14,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-03-04 16:53:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:14,944 INFO L225 Difference]: With dead ends: 27 [2019-03-04 16:53:14,944 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:53:14,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:53:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:53:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-03-04 16:53:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:53:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-03-04 16:53:14,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-03-04 16:53:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:14,950 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-03-04 16:53:14,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:53:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-03-04 16:53:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-03-04 16:53:14,951 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:14,951 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-03-04 16:53:14,951 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:14,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-03-04 16:53:14,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:14,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:14,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:15,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:15,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:15,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:15,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:15,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:15,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:15,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:15,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:53:15,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:15,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:15,088 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:15,095 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:15,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-03-04 16:53:15,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:15,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:53:15,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:53:15,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:15,625 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-03-04 16:53:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:15,798 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-03-04 16:53:15,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:53:15,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-03-04 16:53:15,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:15,801 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:53:15,801 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:53:15,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:53:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-03-04 16:53:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:53:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-03-04 16:53:15,806 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-03-04 16:53:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:15,806 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-03-04 16:53:15,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:53:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-03-04 16:53:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-03-04 16:53:15,807 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:15,808 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-03-04 16:53:15,808 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-03-04 16:53:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:15,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:15,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:15,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:15,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:16,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:16,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:16,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:16,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:16,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-03-04 16:53:16,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:16,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:53:16,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:16,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:16,082 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:16,119 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:16,120 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:16,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-03-04 16:53:16,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:16,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:53:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:53:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:16,637 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-03-04 16:53:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:16,748 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-03-04 16:53:16,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:53:16,749 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-03-04 16:53:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:16,750 INFO L225 Difference]: With dead ends: 33 [2019-03-04 16:53:16,750 INFO L226 Difference]: Without dead ends: 32 [2019-03-04 16:53:16,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-03-04 16:53:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-03-04 16:53:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:53:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-03-04 16:53:16,757 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-03-04 16:53:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:16,757 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-03-04 16:53:16,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:53:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-03-04 16:53:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:53:16,758 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:16,758 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-03-04 16:53:16,759 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-03-04 16:53:16,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:16,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:16,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:16,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:16,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:16,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:16,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:16,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:16,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:16,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:16,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:16,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 37 conjunts are in the unsatisfiable core [2019-03-04 16:53:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:17,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:17,014 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:17,110 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:17,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:17,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-03-04 16:53:17,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:17,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-03-04 16:53:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-03-04 16:53:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:17,615 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-03-04 16:53:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:17,709 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-03-04 16:53:17,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:53:17,709 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-03-04 16:53:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:17,711 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:53:17,711 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:53:17,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:53:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-03-04 16:53:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:53:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-03-04 16:53:17,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-03-04 16:53:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:17,717 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-03-04 16:53:17,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-03-04 16:53:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-03-04 16:53:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-03-04 16:53:17,718 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:17,718 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-03-04 16:53:17,718 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-03-04 16:53:17,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:17,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:17,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:17,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:17,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:17,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:17,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:53:17,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:18,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:18,000 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,031 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,031 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:18,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-03-04 16:53:18,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:18,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-03-04 16:53:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-03-04 16:53:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:53:18,358 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-03-04 16:53:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:18,489 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-03-04 16:53:18,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:53:18,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-03-04 16:53:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:18,491 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:53:18,491 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:53:18,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:53:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:53:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-03-04 16:53:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:53:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-03-04 16:53:18,496 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-03-04 16:53:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:18,496 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-03-04 16:53:18,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-03-04 16:53:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-03-04 16:53:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-03-04 16:53:18,498 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:18,498 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-03-04 16:53:18,498 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-03-04 16:53:18,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:18,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:18,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:18,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:18,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:18,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:18,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:18,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:18,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:18,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-03-04 16:53:18,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:18,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 43 conjunts are in the unsatisfiable core [2019-03-04 16:53:18,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:18,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:18,848 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,878 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:18,878 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:19,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-03-04 16:53:19,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:19,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:53:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:53:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:19,359 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-03-04 16:53:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:19,456 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-03-04 16:53:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:53:19,456 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-03-04 16:53:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:19,457 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:53:19,457 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:53:19,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:53:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-03-04 16:53:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:53:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-03-04 16:53:19,465 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-03-04 16:53:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:19,465 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-03-04 16:53:19,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:53:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-03-04 16:53:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-03-04 16:53:19,466 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:19,466 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-03-04 16:53:19,467 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-03-04 16:53:19,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:19,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:19,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:19,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:19,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:19,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:19,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:19,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:19,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:19,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:19,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:19,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:19,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 46 conjunts are in the unsatisfiable core [2019-03-04 16:53:19,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:19,898 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:19,899 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:19,912 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:19,912 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:20,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-03-04 16:53:20,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:20,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-03-04 16:53:20,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-03-04 16:53:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:53:20,397 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-03-04 16:53:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:20,502 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-03-04 16:53:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:53:20,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-03-04 16:53:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:20,504 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:53:20,504 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:53:20,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:53:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:53:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-03-04 16:53:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:53:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-03-04 16:53:20,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-03-04 16:53:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:20,509 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-03-04 16:53:20,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-03-04 16:53:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-03-04 16:53:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-03-04 16:53:20,510 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:20,510 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-03-04 16:53:20,510 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-03-04 16:53:20,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:20,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:20,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:20,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:20,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:20,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:20,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:20,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:20,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 49 conjunts are in the unsatisfiable core [2019-03-04 16:53:20,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:20,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:20,803 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:20,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:20,814 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:21,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:22,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-03-04 16:53:22,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:22,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-03-04 16:53:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-03-04 16:53:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:22,127 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-03-04 16:53:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:22,233 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-03-04 16:53:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:53:22,234 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-03-04 16:53:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:22,235 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:53:22,235 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:53:22,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:53:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-03-04 16:53:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:53:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-03-04 16:53:22,242 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-03-04 16:53:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:22,242 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-03-04 16:53:22,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-03-04 16:53:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-03-04 16:53:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-03-04 16:53:22,243 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:22,243 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-03-04 16:53:22,244 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-03-04 16:53:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:22,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:22,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:22,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:22,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:22,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:22,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:22,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:22,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:22,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:53:22,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:22,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:53:22,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:22,625 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:22,626 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:22,638 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:22,638 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:23,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-03-04 16:53:23,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:23,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:53:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:53:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:23,419 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-03-04 16:53:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:23,645 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-03-04 16:53:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-03-04 16:53:23,646 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-03-04 16:53:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:23,647 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:53:23,647 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:53:23,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:53:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-03-04 16:53:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:53:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-03-04 16:53:23,653 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-03-04 16:53:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:23,653 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-03-04 16:53:23,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:53:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-03-04 16:53:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:53:23,654 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:23,654 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-03-04 16:53:23,654 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-03-04 16:53:23,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:23,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:23,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:24,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:24,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:24,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:24,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:24,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:24,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:24,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:24,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:24,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:24,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:24,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:53:24,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:24,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:24,109 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:24,113 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:24,114 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:24,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-03-04 16:53:24,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:24,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-03-04 16:53:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-03-04 16:53:24,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:24,735 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-03-04 16:53:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:24,842 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-03-04 16:53:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:53:24,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-03-04 16:53:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:24,843 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:53:24,843 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:53:24,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:53:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-03-04 16:53:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:53:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-03-04 16:53:24,851 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-03-04 16:53:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:24,851 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-03-04 16:53:24,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-03-04 16:53:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-03-04 16:53:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-03-04 16:53:24,852 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:24,852 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-03-04 16:53:24,852 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-03-04 16:53:24,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:24,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:24,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:25,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:25,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:25,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:25,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:25,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:25,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:25,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:25,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:53:25,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:25,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:25,844 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:25,848 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:25,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:28,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:28,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:28,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-03-04 16:53:28,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:28,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-03-04 16:53:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-03-04 16:53:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:53:28,520 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-03-04 16:53:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:28,665 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-03-04 16:53:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:53:28,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-03-04 16:53:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:28,666 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:53:28,666 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:53:28,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:53:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:53:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-03-04 16:53:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:53:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-03-04 16:53:28,672 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-03-04 16:53:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:28,673 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-03-04 16:53:28,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-03-04 16:53:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-03-04 16:53:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-03-04 16:53:28,674 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:28,674 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-03-04 16:53:28,674 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-03-04 16:53:28,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:28,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:28,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:28,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:28,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:29,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:29,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:29,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:29,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:29,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:29,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:29,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:29,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:29,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:53:29,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:29,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-03-04 16:53:29,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:29,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:29,433 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:29,440 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:29,441 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:29,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:30,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:30,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-03-04 16:53:30,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:30,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:53:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:53:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:53:30,241 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-03-04 16:53:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:30,372 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-03-04 16:53:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:53:30,372 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-03-04 16:53:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:30,373 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:53:30,373 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:53:30,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-03-04 16:53:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:53:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-03-04 16:53:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:53:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-03-04 16:53:30,381 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-03-04 16:53:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:30,382 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-03-04 16:53:30,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:53:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-03-04 16:53:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-03-04 16:53:30,383 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:30,383 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-03-04 16:53:30,383 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-03-04 16:53:30,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:30,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:30,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:30,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:30,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:30,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:30,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:30,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:30,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:30,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:30,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:30,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:30,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:53:30,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:30,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:30,780 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:30,784 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:30,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:31,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-03-04 16:53:31,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:31,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-03-04 16:53:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-03-04 16:53:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:53:31,544 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-03-04 16:53:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:31,666 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-03-04 16:53:31,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-03-04 16:53:31,667 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-03-04 16:53:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:31,668 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:53:31,668 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:53:31,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:53:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:53:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-03-04 16:53:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:53:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-03-04 16:53:31,674 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-03-04 16:53:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:31,675 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-03-04 16:53:31,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-03-04 16:53:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-03-04 16:53:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-03-04 16:53:31,676 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:31,676 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-03-04 16:53:31,676 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-03-04 16:53:31,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:31,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:31,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:31,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:31,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:31,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:31,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:31,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:31,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:31,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:31,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:53:32,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:32,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:32,009 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:32,017 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:32,018 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:32,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-03-04 16:53:32,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:32,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-03-04 16:53:32,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-03-04 16:53:32,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:53:32,863 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-03-04 16:53:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:33,005 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-03-04 16:53:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:53:33,005 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-03-04 16:53:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:33,006 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:53:33,007 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:53:33,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:53:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:53:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-03-04 16:53:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:53:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-03-04 16:53:33,013 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-03-04 16:53:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:33,014 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-03-04 16:53:33,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-03-04 16:53:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-03-04 16:53:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-03-04 16:53:33,015 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:33,015 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-03-04 16:53:33,015 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-03-04 16:53:33,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:33,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:33,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:33,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:33,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:33,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:33,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:33,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:33,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:33,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:33,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-03-04 16:53:33,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:33,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:53:33,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:33,629 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:33,630 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:33,639 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:33,640 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:34,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:35,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-03-04 16:53:35,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:35,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:53:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:53:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:53:35,247 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-03-04 16:53:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:35,425 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-03-04 16:53:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:53:35,426 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-03-04 16:53:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:35,427 INFO L225 Difference]: With dead ends: 69 [2019-03-04 16:53:35,427 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:53:35,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:53:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:53:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-03-04 16:53:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:53:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-03-04 16:53:35,434 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-03-04 16:53:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:35,435 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-03-04 16:53:35,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:53:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-03-04 16:53:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-03-04 16:53:35,436 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:35,436 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-03-04 16:53:35,436 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-03-04 16:53:35,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:35,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:35,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:35,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:35,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:35,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:35,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:35,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:35,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:35,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:35,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:35,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:35,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-03-04 16:53:35,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:35,877 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:35,878 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:35,887 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:35,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:36,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-03-04 16:53:36,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:36,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-03-04 16:53:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-03-04 16:53:36,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:53:36,925 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-03-04 16:53:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:37,067 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-03-04 16:53:37,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-03-04 16:53:37,070 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-03-04 16:53:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:37,071 INFO L225 Difference]: With dead ends: 72 [2019-03-04 16:53:37,071 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:53:37,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-03-04 16:53:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:53:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-03-04 16:53:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:53:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-03-04 16:53:37,075 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-03-04 16:53:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:37,076 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-03-04 16:53:37,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-03-04 16:53:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-03-04 16:53:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-03-04 16:53:37,076 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:37,076 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-03-04 16:53:37,077 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-03-04 16:53:37,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:37,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:37,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:37,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:37,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:37,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:37,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:37,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:37,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:37,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:37,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:37,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:53:37,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:37,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:37,486 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:37,498 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-03-04 16:53:38,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:38,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-03-04 16:53:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-03-04 16:53:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:53:38,630 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-03-04 16:53:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:38,808 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-03-04 16:53:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-03-04 16:53:38,808 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-03-04 16:53:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:38,809 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:53:38,809 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:53:38,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:53:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:53:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-03-04 16:53:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:53:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-03-04 16:53:38,815 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-03-04 16:53:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:38,815 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-03-04 16:53:38,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-03-04 16:53:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-03-04 16:53:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:53:38,816 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:38,816 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-03-04 16:53:38,817 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-03-04 16:53:38,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:38,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:38,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:38,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:39,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:39,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:39,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:39,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:39,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:39,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:39,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-03-04 16:53:39,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:39,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-03-04 16:53:39,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:39,558 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:39,559 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,583 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:39,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:39,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:40,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:40,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-03-04 16:53:40,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:40,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:53:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:53:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:53:40,705 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-03-04 16:53:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:40,876 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-03-04 16:53:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:53:40,877 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-03-04 16:53:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:40,878 INFO L225 Difference]: With dead ends: 78 [2019-03-04 16:53:40,878 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:53:40,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:53:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:53:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-03-04 16:53:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:53:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-03-04 16:53:40,883 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-03-04 16:53:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:40,884 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-03-04 16:53:40,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:53:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-03-04 16:53:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-03-04 16:53:40,884 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:40,884 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-03-04 16:53:40,885 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-03-04 16:53:40,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:40,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:40,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:41,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:41,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:41,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:41,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:41,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:41,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:41,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:41,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:41,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-03-04 16:53:41,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:41,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:41,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:41,380 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:41,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:41,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-03-04 16:53:42,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:42,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-03-04 16:53:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-03-04 16:53:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:53:42,683 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-03-04 16:53:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:42,866 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-03-04 16:53:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:53:42,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-03-04 16:53:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:42,867 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:53:42,868 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:53:42,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:53:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:53:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-03-04 16:53:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-03-04 16:53:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-03-04 16:53:42,873 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-03-04 16:53:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:42,873 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-03-04 16:53:42,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-03-04 16:53:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-03-04 16:53:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-03-04 16:53:42,874 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:42,874 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-03-04 16:53:42,875 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-03-04 16:53:42,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:42,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:42,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:42,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:43,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:43,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:43,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:43,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:43,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:43,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:43,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-03-04 16:53:43,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:43,499 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:43,499 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,510 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:43,510 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:44,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:45,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-03-04 16:53:45,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:45,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-03-04 16:53:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-03-04 16:53:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:53:45,171 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-03-04 16:53:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:45,370 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-03-04 16:53:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:53:45,371 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-03-04 16:53:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:45,372 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:53:45,372 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:53:45,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:53:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:53:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-03-04 16:53:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-03-04 16:53:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-03-04 16:53:45,376 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-03-04 16:53:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:45,376 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-03-04 16:53:45,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-03-04 16:53:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-03-04 16:53:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-03-04 16:53:45,377 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:45,377 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-03-04 16:53:45,377 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-03-04 16:53:45,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:45,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:45,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:45,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:45,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:45,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:45,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:45,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:45,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:45,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:45,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-03-04 16:53:45,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:45,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-03-04 16:53:45,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:45,913 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:45,913 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,927 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:45,928 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:47,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-03-04 16:53:47,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:47,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-03-04 16:53:47,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-03-04 16:53:47,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:53:47,384 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-03-04 16:53:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:47,546 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-03-04 16:53:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-03-04 16:53:47,546 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-03-04 16:53:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:47,547 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:53:47,547 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:53:47,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:53:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:53:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-03-04 16:53:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-03-04 16:53:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-03-04 16:53:47,553 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-03-04 16:53:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:47,553 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-03-04 16:53:47,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-03-04 16:53:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-03-04 16:53:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-03-04 16:53:47,554 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:47,554 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-03-04 16:53:47,554 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-03-04 16:53:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:47,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:48,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:48,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:48,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:48,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:48,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:48,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:48,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:48,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:48,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:48,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:48,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:53:48,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:48,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:48,193 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,209 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:48,209 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:48,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-03-04 16:53:50,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:50,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-03-04 16:53:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-03-04 16:53:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:53:50,078 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-03-04 16:53:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:50,251 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-03-04 16:53:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:53:50,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-03-04 16:53:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:50,253 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:53:50,253 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:53:50,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:53:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:53:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-03-04 16:53:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-03-04 16:53:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-03-04 16:53:50,258 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-03-04 16:53:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:50,259 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-03-04 16:53:50,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-03-04 16:53:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-03-04 16:53:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-03-04 16:53:50,259 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:50,260 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-03-04 16:53:50,260 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-03-04 16:53:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:50,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:50,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:50,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:50,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 94 conjunts are in the unsatisfiable core [2019-03-04 16:53:50,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:50,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:50,961 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:50,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:52,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:52,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-03-04 16:53:52,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:52,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-03-04 16:53:52,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-03-04 16:53:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:53:52,916 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-03-04 16:53:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:53,123 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-03-04 16:53:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:53:53,123 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-03-04 16:53:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:53,125 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:53:53,125 INFO L226 Difference]: Without dead ends: 92 [2019-03-04 16:53:53,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:53:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-03-04 16:53:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-03-04 16:53:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:53:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-03-04 16:53:53,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-03-04 16:53:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:53,130 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-03-04 16:53:53,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-03-04 16:53:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-03-04 16:53:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-03-04 16:53:53,131 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:53,131 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-03-04 16:53:53,131 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-03-04 16:53:53,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:53,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:53,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:53,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:53,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:53,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:53,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:53,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-03-04 16:53:53,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:53,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 97 conjunts are in the unsatisfiable core [2019-03-04 16:53:53,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:53,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:53,944 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,955 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:53,955 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:54,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:56,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:56,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-03-04 16:53:56,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:56,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-03-04 16:53:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-03-04 16:53:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:53:56,009 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-03-04 16:53:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:56,202 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-03-04 16:53:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:53:56,203 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-03-04 16:53:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:56,204 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:53:56,204 INFO L226 Difference]: Without dead ends: 95 [2019-03-04 16:53:56,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:53:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-03-04 16:53:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-03-04 16:53:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:53:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-03-04 16:53:56,210 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-03-04 16:53:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:56,210 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-03-04 16:53:56,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-03-04 16:53:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-03-04 16:53:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-03-04 16:53:56,211 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:56,211 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-03-04 16:53:56,211 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-03-04 16:53:56,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:56,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:56,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:56,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:56,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:56,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:56,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:56,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:56,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:56,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:56,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:56,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:56,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:56,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:56,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 100 conjunts are in the unsatisfiable core [2019-03-04 16:53:56,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:56,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:53:56,850 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:56,855 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:56,855 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:53:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:57,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:58,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-03-04 16:53:58,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:58,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-03-04 16:53:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-03-04 16:53:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:53:58,700 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-03-04 16:53:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:58,882 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-03-04 16:53:58,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-03-04 16:53:58,883 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-03-04 16:53:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:58,884 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:53:58,884 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:53:58,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:53:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:53:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-03-04 16:53:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:53:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-03-04 16:53:58,890 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-03-04 16:53:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:58,890 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-03-04 16:53:58,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-03-04 16:53:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-03-04 16:53:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-03-04 16:53:58,891 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:58,891 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-03-04 16:53:58,891 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-03-04 16:53:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:58,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:59,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:59,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:59,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:59,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:00,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:00,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:00,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:54:00,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:00,059 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:00,059 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,069 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:00,070 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:02,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-03-04 16:54:02,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-03-04 16:54:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-03-04 16:54:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:54:02,096 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-03-04 16:54:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:02,321 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-03-04 16:54:02,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:54:02,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-03-04 16:54:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:02,323 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:54:02,323 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:54:02,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:54:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:54:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-03-04 16:54:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:54:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-03-04 16:54:02,328 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-03-04 16:54:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:02,329 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-03-04 16:54:02,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-03-04 16:54:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-03-04 16:54:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-03-04 16:54:02,329 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:02,329 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-03-04 16:54:02,330 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-03-04 16:54:02,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:02,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:02,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:02,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:02,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:02,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:02,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:02,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:02,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:02,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:02,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:03,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-03-04 16:54:03,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 106 conjunts are in the unsatisfiable core [2019-03-04 16:54:03,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:03,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:03,087 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,160 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:03,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:03,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:05,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:05,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-03-04 16:54:05,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:05,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-03-04 16:54:05,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-03-04 16:54:05,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:54:05,479 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-03-04 16:54:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:05,748 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-03-04 16:54:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:54:05,748 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-03-04 16:54:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:05,749 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:54:05,749 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:54:05,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:54:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:54:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-03-04 16:54:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:54:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-03-04 16:54:05,755 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-03-04 16:54:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:05,756 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-03-04 16:54:05,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-03-04 16:54:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-03-04 16:54:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-03-04 16:54:05,756 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:05,757 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-03-04 16:54:05,757 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-03-04 16:54:05,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:05,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:05,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:06,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:06,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:06,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:06,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:06,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:06,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:06,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:06,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:06,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:06,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 109 conjunts are in the unsatisfiable core [2019-03-04 16:54:06,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:06,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:06,498 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:06,518 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:06,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:08,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:08,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-03-04 16:54:08,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:08,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-03-04 16:54:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-03-04 16:54:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:54:08,860 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-03-04 16:54:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:09,138 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-03-04 16:54:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:54:09,139 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-03-04 16:54:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:09,140 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:54:09,140 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:54:09,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:54:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:54:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-03-04 16:54:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-03-04 16:54:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-03-04 16:54:09,146 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-03-04 16:54:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:09,146 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-03-04 16:54:09,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-03-04 16:54:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-03-04 16:54:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-03-04 16:54:09,147 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:09,147 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-03-04 16:54:09,147 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-03-04 16:54:09,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:09,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:09,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:10,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:10,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:10,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:10,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:10,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:10,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:10,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:10,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 112 conjunts are in the unsatisfiable core [2019-03-04 16:54:10,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:10,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:10,135 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,146 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:10,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:12,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:12,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-03-04 16:54:12,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:12,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-03-04 16:54:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-03-04 16:54:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:54:12,525 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-03-04 16:54:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:12,742 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-03-04 16:54:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:54:12,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-03-04 16:54:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:12,744 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:54:12,744 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:54:12,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:54:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:54:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-03-04 16:54:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-03-04 16:54:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-03-04 16:54:12,748 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-03-04 16:54:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:12,749 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-03-04 16:54:12,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-03-04 16:54:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-03-04 16:54:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-03-04 16:54:12,749 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:12,749 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-03-04 16:54:12,749 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:12,750 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-03-04 16:54:12,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:12,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:14,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:14,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:14,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:14,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:14,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:14,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:14,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:14,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:14,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 16:54:14,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:14,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:54:14,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:14,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:14,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:14,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:15,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:16,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-03-04 16:54:16,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:16,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:54:16,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:54:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:54:16,887 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-03-04 16:54:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:17,187 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-03-04 16:54:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-03-04 16:54:17,187 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-03-04 16:54:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:17,188 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:54:17,188 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:54:17,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:54:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:54:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-03-04 16:54:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:54:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-03-04 16:54:17,193 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-03-04 16:54:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:17,193 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-03-04 16:54:17,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:54:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-03-04 16:54:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-03-04 16:54:17,194 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:17,194 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-03-04 16:54:17,195 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-03-04 16:54:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:17,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:17,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:17,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:18,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:18,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:18,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:18,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:18,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:18,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:18,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:19,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:19,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:19,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 118 conjunts are in the unsatisfiable core [2019-03-04 16:54:19,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:19,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:19,037 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,044 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:19,044 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:20,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:22,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:22,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-03-04 16:54:22,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:22,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-03-04 16:54:22,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-03-04 16:54:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:54:22,039 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-03-04 16:54:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:22,257 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-03-04 16:54:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:54:22,258 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-03-04 16:54:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:22,259 INFO L225 Difference]: With dead ends: 117 [2019-03-04 16:54:22,259 INFO L226 Difference]: Without dead ends: 116 [2019-03-04 16:54:22,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:54:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-03-04 16:54:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-03-04 16:54:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-03-04 16:54:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-03-04 16:54:22,263 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-03-04 16:54:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:22,264 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-03-04 16:54:22,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-03-04 16:54:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-03-04 16:54:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-03-04 16:54:22,264 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:22,265 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-03-04 16:54:22,265 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-03-04 16:54:22,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:22,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:22,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:23,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:23,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:23,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:23,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:23,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:23,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:23,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 121 conjunts are in the unsatisfiable core [2019-03-04 16:54:23,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:23,072 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:23,073 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,084 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:23,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:23,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:26,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-03-04 16:54:26,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:26,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-03-04 16:54:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-03-04 16:54:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:54:26,081 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-03-04 16:54:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:26,387 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-03-04 16:54:26,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:54:26,387 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-03-04 16:54:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:26,388 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:54:26,389 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:54:26,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-03-04 16:54:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:54:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-03-04 16:54:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-03-04 16:54:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-03-04 16:54:26,395 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-03-04 16:54:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:26,395 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-03-04 16:54:26,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-03-04 16:54:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-03-04 16:54:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-03-04 16:54:26,396 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:26,396 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-03-04 16:54:26,396 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:26,397 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-03-04 16:54:26,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:26,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:26,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:26,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:26,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:27,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:27,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:27,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:27,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:27,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:27,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:27,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-03-04 16:54:27,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 124 conjunts are in the unsatisfiable core [2019-03-04 16:54:27,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:27,508 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:27,508 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:27,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:28,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:30,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:30,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-03-04 16:54:30,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:30,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:54:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:54:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:54:30,906 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-03-04 16:54:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:31,269 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-03-04 16:54:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-03-04 16:54:31,270 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-03-04 16:54:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:31,271 INFO L225 Difference]: With dead ends: 123 [2019-03-04 16:54:31,271 INFO L226 Difference]: Without dead ends: 122 [2019-03-04 16:54:31,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:54:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-03-04 16:54:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-03-04 16:54:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:54:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-03-04 16:54:31,277 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-03-04 16:54:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:31,277 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-03-04 16:54:31,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:54:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-03-04 16:54:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-03-04 16:54:31,277 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:31,278 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-03-04 16:54:31,278 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-03-04 16:54:31,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:31,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:31,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:32,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:32,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:32,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:32,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:32,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:32,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:32,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:32,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:32,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:32,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:32,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 127 conjunts are in the unsatisfiable core [2019-03-04 16:54:32,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:32,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:32,443 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,537 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:32,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:34,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:36,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-03-04 16:54:36,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:36,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-03-04 16:54:36,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-03-04 16:54:36,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:54:36,770 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-03-04 16:54:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:37,091 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-03-04 16:54:37,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-03-04 16:54:37,092 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-03-04 16:54:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:37,093 INFO L225 Difference]: With dead ends: 126 [2019-03-04 16:54:37,093 INFO L226 Difference]: Without dead ends: 125 [2019-03-04 16:54:37,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:54:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-03-04 16:54:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-03-04 16:54:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-03-04 16:54:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-03-04 16:54:37,100 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-03-04 16:54:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:37,100 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-03-04 16:54:37,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-03-04 16:54:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-03-04 16:54:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-03-04 16:54:37,101 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:37,101 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-03-04 16:54:37,101 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-03-04 16:54:37,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:37,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:37,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:37,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:37,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:37,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:37,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:37,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:37,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:37,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:37,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:37,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:38,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 130 conjunts are in the unsatisfiable core [2019-03-04 16:54:38,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:38,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:38,025 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,034 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:38,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:39,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:41,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:41,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-03-04 16:54:41,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:41,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-03-04 16:54:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-03-04 16:54:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:54:41,423 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-03-04 16:54:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:41,786 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-03-04 16:54:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-03-04 16:54:41,787 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-03-04 16:54:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:41,791 INFO L225 Difference]: With dead ends: 129 [2019-03-04 16:54:41,791 INFO L226 Difference]: Without dead ends: 128 [2019-03-04 16:54:41,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:54:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-03-04 16:54:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-03-04 16:54:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:54:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-03-04 16:54:41,797 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-03-04 16:54:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:41,797 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-03-04 16:54:41,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-03-04 16:54:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-03-04 16:54:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-03-04 16:54:41,798 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:41,798 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-03-04 16:54:41,799 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-03-04 16:54:41,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:41,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:41,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:46,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:46,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:46,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:46,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:46,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-03-04 16:54:46,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:46,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 133 conjunts are in the unsatisfiable core [2019-03-04 16:54:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:46,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:46,965 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,970 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:46,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:48,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:50,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:50,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-03-04 16:54:50,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:50,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:54:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:54:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:54:50,195 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-03-04 16:54:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:50,516 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-03-04 16:54:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:54:50,517 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-03-04 16:54:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:50,518 INFO L225 Difference]: With dead ends: 132 [2019-03-04 16:54:50,518 INFO L226 Difference]: Without dead ends: 131 [2019-03-04 16:54:50,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:54:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-03-04 16:54:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-03-04 16:54:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-03-04 16:54:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-03-04 16:54:50,524 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-03-04 16:54:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:50,524 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-03-04 16:54:50,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:54:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-03-04 16:54:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-03-04 16:54:50,525 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:50,525 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-03-04 16:54:50,525 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-03-04 16:54:50,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:50,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:50,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:51,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:51,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:51,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:51,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:51,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:51,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:51,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:51,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:51,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:51,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:51,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 136 conjunts are in the unsatisfiable core [2019-03-04 16:54:51,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:51,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:51,944 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,955 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:51,956 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:53,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:55,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:55,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-03-04 16:54:55,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:55,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-03-04 16:54:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-03-04 16:54:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:54:55,446 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-03-04 16:54:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:55,996 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-03-04 16:54:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-03-04 16:54:55,996 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-03-04 16:54:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:55,997 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:54:55,998 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:54:55,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:54:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:54:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-03-04 16:54:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:54:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-03-04 16:54:56,002 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-03-04 16:54:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:56,003 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-03-04 16:54:56,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-03-04 16:54:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-03-04 16:54:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:54:56,003 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:56,003 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-03-04 16:54:56,004 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-03-04 16:54:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:56,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:56,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:56,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:57,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:57,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:57,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:57,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:57,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:57,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:54:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:57,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:57,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 16:54:57,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:57,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:54:57,173 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:54:57,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:54:57,186 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:54:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:58,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:01,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:01,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-03-04 16:55:01,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:01,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-03-04 16:55:01,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-03-04 16:55:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:55:01,010 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-03-04 16:55:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:01,343 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-03-04 16:55:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-03-04 16:55:01,344 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-03-04 16:55:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:01,345 INFO L225 Difference]: With dead ends: 138 [2019-03-04 16:55:01,345 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:55:01,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:55:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:55:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-03-04 16:55:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:55:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-03-04 16:55:01,350 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-03-04 16:55:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:01,351 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-03-04 16:55:01,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-03-04 16:55:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-03-04 16:55:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:55:01,351 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:01,351 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-03-04 16:55:01,352 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-03-04 16:55:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:01,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:01,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:02,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:02,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:02,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:02,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:02,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:02,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:02,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:02,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:03,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-03-04 16:55:03,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:03,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 142 conjunts are in the unsatisfiable core [2019-03-04 16:55:03,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:03,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:03,044 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,057 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:03,057 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:07,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:07,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-03-04 16:55:07,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:55:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:55:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:55:07,189 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-03-04 16:55:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:07,476 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-03-04 16:55:07,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:55:07,478 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-03-04 16:55:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:07,480 INFO L225 Difference]: With dead ends: 141 [2019-03-04 16:55:07,480 INFO L226 Difference]: Without dead ends: 140 [2019-03-04 16:55:07,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:55:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-03-04 16:55:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-03-04 16:55:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:55:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-03-04 16:55:07,486 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-03-04 16:55:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:07,487 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-03-04 16:55:07,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:55:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-03-04 16:55:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-03-04 16:55:07,488 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:07,488 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-03-04 16:55:07,488 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-03-04 16:55:07,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:07,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:07,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:07,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:07,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:08,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:08,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:08,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:08,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:08,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:08,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:08,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:08,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:08,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:08,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:08,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 145 conjunts are in the unsatisfiable core [2019-03-04 16:55:08,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:08,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:08,788 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,796 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:10,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:12,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:12,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-03-04 16:55:12,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:12,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-03-04 16:55:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-03-04 16:55:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:55:12,966 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-03-04 16:55:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:13,353 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-03-04 16:55:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:55:13,354 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-03-04 16:55:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:13,355 INFO L225 Difference]: With dead ends: 144 [2019-03-04 16:55:13,355 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:55:13,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:55:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:55:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-03-04 16:55:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-03-04 16:55:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-03-04 16:55:13,361 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-03-04 16:55:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:13,361 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-03-04 16:55:13,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-03-04 16:55:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-03-04 16:55:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-03-04 16:55:13,362 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:13,363 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-03-04 16:55:13,363 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-03-04 16:55:13,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:13,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:13,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:14,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:14,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:14,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:14,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:14,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:14,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 148 conjunts are in the unsatisfiable core [2019-03-04 16:55:14,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:14,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:14,973 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,984 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,984 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:16,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:19,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-03-04 16:55:19,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:19,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-03-04 16:55:19,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-03-04 16:55:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:55:19,776 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-03-04 16:55:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:20,093 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-03-04 16:55:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-03-04 16:55:20,094 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-03-04 16:55:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:20,095 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:55:20,095 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:55:20,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:55:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:55:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-03-04 16:55:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-03-04 16:55:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-03-04 16:55:20,099 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-03-04 16:55:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:20,099 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-03-04 16:55:20,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-03-04 16:55:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-03-04 16:55:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-03-04 16:55:20,100 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:20,100 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-03-04 16:55:20,100 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:20,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-03-04 16:55:20,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:20,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:20,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:21,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:21,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:21,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:21,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:21,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:21,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:21,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:21,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-03-04 16:55:21,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:21,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 151 conjunts are in the unsatisfiable core [2019-03-04 16:55:21,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:21,447 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:21,448 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:21,528 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:21,529 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:22,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:25,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-03-04 16:55:25,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:25,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-03-04 16:55:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-03-04 16:55:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:55:25,793 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-03-04 16:55:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:26,156 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-03-04 16:55:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:55:26,156 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-03-04 16:55:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:26,158 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:55:26,158 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:55:26,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-03-04 16:55:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:55:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-03-04 16:55:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:55:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-03-04 16:55:26,165 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-03-04 16:55:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:26,165 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-03-04 16:55:26,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-03-04 16:55:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-03-04 16:55:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-03-04 16:55:26,166 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:26,166 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-03-04 16:55:26,166 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-03-04 16:55:26,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:26,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:26,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:26,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:27,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:27,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:27,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:27,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:27,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:27,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:27,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:27,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:27,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:27,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:27,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 154 conjunts are in the unsatisfiable core [2019-03-04 16:55:27,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:27,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:27,697 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:27,701 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:27,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:29,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:32,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:32,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-03-04 16:55:32,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:32,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-03-04 16:55:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-03-04 16:55:32,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:55:32,384 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-03-04 16:55:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:32,843 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-03-04 16:55:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:55:32,843 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-03-04 16:55:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:32,844 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:55:32,845 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:55:32,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-03-04 16:55:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:55:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-03-04 16:55:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-03-04 16:55:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-03-04 16:55:32,851 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-03-04 16:55:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:32,852 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-03-04 16:55:32,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-03-04 16:55:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-03-04 16:55:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-03-04 16:55:32,853 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:32,853 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-03-04 16:55:32,853 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-03-04 16:55:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:32,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:32,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:32,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:32,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:34,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:34,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:34,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:34,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:34,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:34,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:34,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:34,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:34,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 157 conjunts are in the unsatisfiable core [2019-03-04 16:55:34,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:34,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:34,415 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:34,512 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:34,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:36,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:39,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-03-04 16:55:39,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:39,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-03-04 16:55:39,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-03-04 16:55:39,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:55:39,381 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-03-04 16:55:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:39,728 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-03-04 16:55:39,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:55:39,728 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-03-04 16:55:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:39,729 INFO L225 Difference]: With dead ends: 156 [2019-03-04 16:55:39,730 INFO L226 Difference]: Without dead ends: 155 [2019-03-04 16:55:39,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-03-04 16:55:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-03-04 16:55:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-03-04 16:55:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-03-04 16:55:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-03-04 16:55:39,736 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-03-04 16:55:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-03-04 16:55:39,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-03-04 16:55:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-03-04 16:55:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-03-04 16:55:39,737 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:39,737 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-03-04 16:55:39,737 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-03-04 16:55:39,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:39,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:39,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:41,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:41,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:41,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:41,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:41,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:41,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:41,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:41,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:41,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-03-04 16:55:41,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:41,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 160 conjunts are in the unsatisfiable core [2019-03-04 16:55:41,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:41,292 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:41,292 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:41,305 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:41,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:43,157 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:46,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-03-04 16:55:46,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:46,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:55:46,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:55:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-03-04 16:55:46,297 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-03-04 16:55:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:46,609 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-03-04 16:55:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-03-04 16:55:46,610 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-03-04 16:55:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:46,611 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:55:46,612 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:55:46,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-03-04 16:55:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:55:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-03-04 16:55:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:55:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-03-04 16:55:46,616 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-03-04 16:55:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:46,617 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-03-04 16:55:46,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:55:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-03-04 16:55:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:55:46,618 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:46,618 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-03-04 16:55:46,618 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-03-04 16:55:46,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:46,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:46,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:48,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:48,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:48,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:48,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:48,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:48,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:48,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:48,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:48,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:48,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:48,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:55:48,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:48,599 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:48,599 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,610 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,611 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-03-04 16:55:53,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:53,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-03-04 16:55:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-03-04 16:55:53,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:55:53,851 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-03-04 16:55:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:54,233 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-03-04 16:55:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:55:54,234 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-03-04 16:55:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:54,235 INFO L225 Difference]: With dead ends: 162 [2019-03-04 16:55:54,235 INFO L226 Difference]: Without dead ends: 161 [2019-03-04 16:55:54,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-03-04 16:55:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-03-04 16:55:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-03-04 16:55:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-03-04 16:55:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-03-04 16:55:54,240 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-03-04 16:55:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:54,241 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-03-04 16:55:54,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-03-04 16:55:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-03-04 16:55:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-03-04 16:55:54,241 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:54,242 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-03-04 16:55:54,242 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-03-04 16:55:54,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:54,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:54,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:54,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:55,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:55,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:55,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:55,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:55,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:55,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:55,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:55,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:55,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 166 conjunts are in the unsatisfiable core [2019-03-04 16:55:55,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:55,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:55:55,755 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,772 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:55:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:57,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:00,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-03-04 16:56:00,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:00,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-03-04 16:56:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-03-04 16:56:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:56:00,936 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-03-04 16:56:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:01,355 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-03-04 16:56:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:56:01,355 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-03-04 16:56:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:01,356 INFO L225 Difference]: With dead ends: 165 [2019-03-04 16:56:01,356 INFO L226 Difference]: Without dead ends: 164 [2019-03-04 16:56:01,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:56:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-03-04 16:56:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-03-04 16:56:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-03-04 16:56:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-03-04 16:56:01,361 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-03-04 16:56:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:01,361 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-03-04 16:56:01,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-03-04 16:56:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-03-04 16:56:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-03-04 16:56:01,362 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:01,362 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-03-04 16:56:01,362 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-03-04 16:56:01,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:01,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:01,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:03,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:03,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:03,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:03,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:03,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:03,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:03,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:03,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:03,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-03-04 16:56:03,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:03,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 169 conjunts are in the unsatisfiable core [2019-03-04 16:56:03,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:03,269 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:03,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:03,277 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:03,278 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:05,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:09,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:09,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-03-04 16:56:09,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:09,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-03-04 16:56:09,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-03-04 16:56:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:56:09,421 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-03-04 16:56:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:09,853 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-03-04 16:56:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:56:09,854 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-03-04 16:56:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:09,855 INFO L225 Difference]: With dead ends: 168 [2019-03-04 16:56:09,855 INFO L226 Difference]: Without dead ends: 167 [2019-03-04 16:56:09,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-03-04 16:56:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-03-04 16:56:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-03-04 16:56:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-03-04 16:56:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-03-04 16:56:09,861 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-03-04 16:56:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:09,862 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-03-04 16:56:09,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-03-04 16:56:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-03-04 16:56:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-03-04 16:56:09,863 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:09,863 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-03-04 16:56:09,863 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-03-04 16:56:09,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:09,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:09,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:09,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:09,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:11,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:11,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:11,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:11,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:11,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:11,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:11,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:11,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:11,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:11,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:11,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 172 conjunts are in the unsatisfiable core [2019-03-04 16:56:11,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:11,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:11,451 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:11,530 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:11,530 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:13,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:16,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-03-04 16:56:16,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:16,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-03-04 16:56:16,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-03-04 16:56:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:56:16,824 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-03-04 16:56:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:17,215 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-03-04 16:56:17,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-03-04 16:56:17,216 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-03-04 16:56:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:17,217 INFO L225 Difference]: With dead ends: 171 [2019-03-04 16:56:17,217 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:56:17,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-03-04 16:56:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:56:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-03-04 16:56:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-03-04 16:56:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-03-04 16:56:17,222 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-03-04 16:56:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:17,222 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-03-04 16:56:17,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-03-04 16:56:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-03-04 16:56:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-03-04 16:56:17,223 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:17,223 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-03-04 16:56:17,223 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-03-04 16:56:17,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:17,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:17,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:18,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:18,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:18,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:18,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:18,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:18,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:18,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:19,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 175 conjunts are in the unsatisfiable core [2019-03-04 16:56:19,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:19,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:19,053 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:19,062 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:19,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:24,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:24,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-03-04 16:56:24,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:24,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-03-04 16:56:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-03-04 16:56:24,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:56:24,389 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-03-04 16:56:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:24,760 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-03-04 16:56:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:56:24,760 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-03-04 16:56:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:24,761 INFO L225 Difference]: With dead ends: 174 [2019-03-04 16:56:24,762 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:56:24,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:56:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:56:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-03-04 16:56:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-03-04 16:56:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-03-04 16:56:24,767 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-03-04 16:56:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:24,767 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-03-04 16:56:24,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-03-04 16:56:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-03-04 16:56:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-03-04 16:56:24,768 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:24,768 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-03-04 16:56:24,768 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-03-04 16:56:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:24,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:26,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:26,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:26,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:26,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:26,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:26,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:26,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:26,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:26,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-03-04 16:56:26,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:26,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 178 conjunts are in the unsatisfiable core [2019-03-04 16:56:26,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:26,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:26,559 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:26,568 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:26,568 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:28,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:32,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:32,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-03-04 16:56:32,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:32,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-03-04 16:56:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-03-04 16:56:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:56:32,228 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-03-04 16:56:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:32,640 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-03-04 16:56:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:56:32,641 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-03-04 16:56:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:32,642 INFO L225 Difference]: With dead ends: 177 [2019-03-04 16:56:32,642 INFO L226 Difference]: Without dead ends: 176 [2019-03-04 16:56:32,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-03-04 16:56:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-03-04 16:56:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-03-04 16:56:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-03-04 16:56:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-03-04 16:56:32,646 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-03-04 16:56:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:32,646 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-03-04 16:56:32,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-03-04 16:56:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-03-04 16:56:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-03-04 16:56:32,647 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:32,647 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-03-04 16:56:32,647 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-03-04 16:56:32,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:32,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:32,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:34,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:34,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:34,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:34,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:34,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:34,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:34,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:34,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:34,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:34,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 181 conjunts are in the unsatisfiable core [2019-03-04 16:56:34,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:34,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:34,537 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:34,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:34,550 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:36,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:40,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:40,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-03-04 16:56:40,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:40,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-03-04 16:56:40,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-03-04 16:56:40,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:56:40,163 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-03-04 16:56:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:40,625 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-03-04 16:56:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:56:40,625 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-03-04 16:56:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:40,627 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:56:40,627 INFO L226 Difference]: Without dead ends: 179 [2019-03-04 16:56:40,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-03-04 16:56:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-03-04 16:56:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-03-04 16:56:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:56:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-03-04 16:56:40,632 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-03-04 16:56:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:40,633 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-03-04 16:56:40,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-03-04 16:56:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-03-04 16:56:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-03-04 16:56:40,634 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:40,634 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-03-04 16:56:40,634 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-03-04 16:56:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:40,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:40,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:42,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:42,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:42,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:42,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:42,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:42,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:42,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 184 conjunts are in the unsatisfiable core [2019-03-04 16:56:42,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:42,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:42,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,327 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,327 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:44,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:47,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:47,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-03-04 16:56:47,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-03-04 16:56:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-03-04 16:56:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:56:47,991 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-03-04 16:56:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:48,495 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-03-04 16:56:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-03-04 16:56:48,495 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-03-04 16:56:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:48,497 INFO L225 Difference]: With dead ends: 183 [2019-03-04 16:56:48,497 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:56:48,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-03-04 16:56:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:56:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-03-04 16:56:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-03-04 16:56:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-03-04 16:56:48,503 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-03-04 16:56:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:48,503 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-03-04 16:56:48,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-03-04 16:56:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-03-04 16:56:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-03-04 16:56:48,504 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:48,504 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-03-04 16:56:48,504 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-03-04 16:56:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:48,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:48,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:48,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:50,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:50,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:50,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:50,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:50,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:50,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:50,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:50,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:50,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-03-04 16:56:50,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:50,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 187 conjunts are in the unsatisfiable core [2019-03-04 16:56:50,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:50,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:50,732 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:50,741 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:50,741 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:56:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:52,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:56,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:56,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-03-04 16:56:56,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:56,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-03-04 16:56:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-03-04 16:56:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:56:56,653 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-03-04 16:56:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:57,047 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-03-04 16:56:57,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:56:57,047 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-03-04 16:56:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:57,049 INFO L225 Difference]: With dead ends: 186 [2019-03-04 16:56:57,049 INFO L226 Difference]: Without dead ends: 185 [2019-03-04 16:56:57,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-03-04 16:56:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-03-04 16:56:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-03-04 16:56:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-03-04 16:56:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-03-04 16:56:57,055 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-03-04 16:56:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:57,055 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-03-04 16:56:57,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-03-04 16:56:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-03-04 16:56:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-03-04 16:56:57,057 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:57,057 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-03-04 16:56:57,057 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:57,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-03-04 16:56:57,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:57,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:57,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:58,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:58,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:58,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:58,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:58,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:58,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:58,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:58,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:58,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:58,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:58,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 190 conjunts are in the unsatisfiable core [2019-03-04 16:56:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:58,971 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:56:58,972 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:59,006 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:59,007 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:01,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:04,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:04,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-03-04 16:57:04,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:04,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-03-04 16:57:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-03-04 16:57:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:57:04,938 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-03-04 16:57:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:05,383 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-03-04 16:57:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:57:05,383 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-03-04 16:57:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:05,384 INFO L225 Difference]: With dead ends: 189 [2019-03-04 16:57:05,384 INFO L226 Difference]: Without dead ends: 188 [2019-03-04 16:57:05,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:57:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-03-04 16:57:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-03-04 16:57:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-03-04 16:57:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-03-04 16:57:05,389 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-03-04 16:57:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:05,389 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-03-04 16:57:05,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-03-04 16:57:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-03-04 16:57:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-03-04 16:57:05,390 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:05,390 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-03-04 16:57:05,390 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-03-04 16:57:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:05,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:05,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:07,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:07,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:07,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:07,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:07,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:07,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:07,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:07,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 193 conjunts are in the unsatisfiable core [2019-03-04 16:57:07,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:07,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:57:07,255 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:07,267 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:07,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:09,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-03-04 16:57:13,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:13,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-03-04 16:57:13,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-03-04 16:57:13,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:57:13,293 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-03-04 16:57:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:13,799 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-03-04 16:57:13,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:57:13,799 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-03-04 16:57:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:13,800 INFO L225 Difference]: With dead ends: 192 [2019-03-04 16:57:13,801 INFO L226 Difference]: Without dead ends: 191 [2019-03-04 16:57:13,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:57:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-03-04 16:57:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-03-04 16:57:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-03-04 16:57:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-03-04 16:57:13,806 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-03-04 16:57:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:13,807 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-03-04 16:57:13,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-03-04 16:57:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-03-04 16:57:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-03-04 16:57:13,807 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:13,807 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-03-04 16:57:13,808 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-03-04 16:57:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:13,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:13,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:15,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:15,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:15,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:15,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:15,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:15,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:15,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:16,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-03-04 16:57:16,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:16,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 196 conjunts are in the unsatisfiable core [2019-03-04 16:57:16,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:16,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:57:16,096 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:16,107 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:16,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:18,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:22,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:22,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-03-04 16:57:22,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:22,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:57:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:57:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:57:22,233 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-03-04 16:57:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:22,726 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-03-04 16:57:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:57:22,726 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-03-04 16:57:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:22,728 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:57:22,728 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:57:22,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:57:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:57:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-03-04 16:57:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-03-04 16:57:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-03-04 16:57:22,733 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-03-04 16:57:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:22,733 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-03-04 16:57:22,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:57:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-03-04 16:57:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-03-04 16:57:22,734 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:22,734 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-03-04 16:57:22,734 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-03-04 16:57:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:22,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:22,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:24,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:24,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:24,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:24,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:24,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:24,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:24,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:24,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:24,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:24,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:24,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 199 conjunts are in the unsatisfiable core [2019-03-04 16:57:24,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:24,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:57:24,892 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:24,900 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:24,901 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:27,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:31,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:31,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-03-04 16:57:31,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:31,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-03-04 16:57:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-03-04 16:57:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:57:31,075 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-03-04 16:57:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:31,614 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-03-04 16:57:31,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-03-04 16:57:31,614 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-03-04 16:57:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:31,616 INFO L225 Difference]: With dead ends: 198 [2019-03-04 16:57:31,616 INFO L226 Difference]: Without dead ends: 197 [2019-03-04 16:57:31,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:57:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-03-04 16:57:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-03-04 16:57:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:57:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-03-04 16:57:31,622 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-03-04 16:57:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:31,622 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-03-04 16:57:31,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-03-04 16:57:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-03-04 16:57:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:57:31,623 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:31,624 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-03-04 16:57:31,624 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-03-04 16:57:31,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:31,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:31,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:31,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:31,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:33,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:33,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:33,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:33,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:33,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:33,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:33,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:33,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 202 conjunts are in the unsatisfiable core [2019-03-04 16:57:33,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:33,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:57:33,617 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,628 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,628 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:36,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:39,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:39,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-03-04 16:57:39,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:39,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-03-04 16:57:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-03-04 16:57:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:57:39,958 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-03-04 16:57:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:40,413 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-03-04 16:57:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:57:40,414 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-03-04 16:57:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:40,415 INFO L225 Difference]: With dead ends: 201 [2019-03-04 16:57:40,416 INFO L226 Difference]: Without dead ends: 200 [2019-03-04 16:57:40,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-03-04 16:57:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-03-04 16:57:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-03-04 16:57:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-03-04 16:57:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-03-04 16:57:40,423 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-03-04 16:57:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:40,423 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-03-04 16:57:40,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-03-04 16:57:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-03-04 16:57:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-03-04 16:57:40,424 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:40,425 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-03-04 16:57:40,425 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-03-04 16:57:40,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:40,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:40,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:42,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:42,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:42,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:42,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:42,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:42,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:42,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:42,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:42,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-03-04 16:57:42,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:42,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 205 conjunts are in the unsatisfiable core [2019-03-04 16:57:42,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:42,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:57:42,836 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:42,853 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:42,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:45,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:49,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:49,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-03-04 16:57:49,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:49,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-03-04 16:57:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-03-04 16:57:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:57:49,055 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-03-04 16:57:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:49,513 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-03-04 16:57:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:57:49,513 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-03-04 16:57:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:49,514 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:57:49,514 INFO L226 Difference]: Without dead ends: 203 [2019-03-04 16:57:49,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-03-04 16:57:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-03-04 16:57:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-03-04 16:57:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:57:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-03-04 16:57:49,519 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-03-04 16:57:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:49,519 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-03-04 16:57:49,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-03-04 16:57:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-03-04 16:57:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-03-04 16:57:49,520 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:49,520 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-03-04 16:57:49,520 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-03-04 16:57:49,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:49,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:49,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:49,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:49,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:51,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:51,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:51,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:51,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:51,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:51,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:51,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:51,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:51,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:51,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:51,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 208 conjunts are in the unsatisfiable core [2019-03-04 16:57:51,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:51,824 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:57:51,825 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:51,834 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:51,834 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:57:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:54,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:58,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:58,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-03-04 16:57:58,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:58,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-03-04 16:57:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-03-04 16:57:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:57:58,205 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-03-04 16:57:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:58,747 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-03-04 16:57:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-03-04 16:57:58,747 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-03-04 16:57:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:58,748 INFO L225 Difference]: With dead ends: 207 [2019-03-04 16:57:58,748 INFO L226 Difference]: Without dead ends: 206 [2019-03-04 16:57:58,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-03-04 16:57:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-03-04 16:57:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-03-04 16:57:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-03-04 16:57:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-03-04 16:57:58,753 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-03-04 16:57:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:58,753 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-03-04 16:57:58,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-03-04 16:57:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-03-04 16:57:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-03-04 16:57:58,754 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:58,754 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-03-04 16:57:58,754 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-03-04 16:57:58,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:58,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:58,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:01,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:01,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:01,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:01,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:01,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:01,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:01,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:01,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:01,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 211 conjunts are in the unsatisfiable core [2019-03-04 16:58:01,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:01,080 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:01,080 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:01,088 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:01,088 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:03,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:07,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-03-04 16:58:07,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:07,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-03-04 16:58:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-03-04 16:58:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:58:07,274 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-03-04 16:58:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:07,678 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-03-04 16:58:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:58:07,678 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-03-04 16:58:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:07,679 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:58:07,680 INFO L226 Difference]: Without dead ends: 209 [2019-03-04 16:58:07,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:58:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-03-04 16:58:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-03-04 16:58:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-03-04 16:58:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-03-04 16:58:07,684 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-03-04 16:58:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:07,684 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-03-04 16:58:07,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-03-04 16:58:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-03-04 16:58:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-03-04 16:58:07,685 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:07,685 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-03-04 16:58:07,685 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:07,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-03-04 16:58:07,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:07,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:09,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:09,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:09,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:09,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:09,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:09,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:09,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:09,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:10,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-03-04 16:58:10,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:10,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 214 conjunts are in the unsatisfiable core [2019-03-04 16:58:10,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:10,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:10,118 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:10,130 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:10,130 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:12,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:16,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:16,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-03-04 16:58:16,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:16,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-03-04 16:58:16,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-03-04 16:58:16,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 16:58:16,596 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-03-04 16:58:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:17,112 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-03-04 16:58:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-03-04 16:58:17,113 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-03-04 16:58:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:17,114 INFO L225 Difference]: With dead ends: 213 [2019-03-04 16:58:17,114 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:58:17,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-03-04 16:58:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:58:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-03-04 16:58:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-03-04 16:58:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-03-04 16:58:17,121 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-03-04 16:58:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:17,122 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-03-04 16:58:17,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-03-04 16:58:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-03-04 16:58:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-03-04 16:58:17,123 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:17,123 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-03-04 16:58:17,123 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-03-04 16:58:17,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:17,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:17,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:19,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:19,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:19,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:19,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:19,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:19,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:19,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:19,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:19,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:19,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:19,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 217 conjunts are in the unsatisfiable core [2019-03-04 16:58:19,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:19,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:19,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:19,434 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:19,448 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:22,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:25,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:25,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-03-04 16:58:25,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-03-04 16:58:25,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-03-04 16:58:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:58:25,934 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-03-04 16:58:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:26,404 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-03-04 16:58:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:58:26,405 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-03-04 16:58:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:26,406 INFO L225 Difference]: With dead ends: 216 [2019-03-04 16:58:26,406 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:58:26,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-03-04 16:58:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:58:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-03-04 16:58:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:58:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-03-04 16:58:26,414 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-03-04 16:58:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:26,414 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-03-04 16:58:26,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-03-04 16:58:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-03-04 16:58:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-03-04 16:58:26,415 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:26,415 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-03-04 16:58:26,415 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-03-04 16:58:26,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:26,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:26,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:26,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:26,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:28,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:28,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:28,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:28,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:28,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:28,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:28,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:28,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:28,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 220 conjunts are in the unsatisfiable core [2019-03-04 16:58:28,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:28,742 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:28,742 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:28,754 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:28,754 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:31,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:35,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:35,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-03-04 16:58:35,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:35,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-03-04 16:58:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-03-04 16:58:35,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:58:35,341 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-03-04 16:58:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:35,782 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-03-04 16:58:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-03-04 16:58:35,782 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-03-04 16:58:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:35,783 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:58:35,784 INFO L226 Difference]: Without dead ends: 218 [2019-03-04 16:58:35,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-03-04 16:58:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-03-04 16:58:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-03-04 16:58:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:58:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-03-04 16:58:35,789 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-03-04 16:58:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:35,789 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-03-04 16:58:35,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-03-04 16:58:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-03-04 16:58:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:58:35,790 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:35,791 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-03-04 16:58:35,791 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-03-04 16:58:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:35,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:35,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:38,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:38,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:38,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:38,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:38,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:38,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:38,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:38,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:38,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-03-04 16:58:38,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:38,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 223 conjunts are in the unsatisfiable core [2019-03-04 16:58:38,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:38,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:38,399 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:38,410 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:38,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:41,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:44,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:44,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-03-04 16:58:44,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:44,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-03-04 16:58:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-03-04 16:58:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:58:44,920 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-03-04 16:58:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:45,387 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-03-04 16:58:45,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-03-04 16:58:45,387 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-03-04 16:58:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:45,389 INFO L225 Difference]: With dead ends: 222 [2019-03-04 16:58:45,389 INFO L226 Difference]: Without dead ends: 221 [2019-03-04 16:58:45,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 16:58:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-03-04 16:58:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-03-04 16:58:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:58:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-03-04 16:58:45,394 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-03-04 16:58:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:45,394 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-03-04 16:58:45,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-03-04 16:58:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-03-04 16:58:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-03-04 16:58:45,395 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:45,395 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-03-04 16:58:45,395 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-03-04 16:58:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:45,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:45,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:47,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:47,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:47,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:47,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:47,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:47,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:47,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:47,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:47,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:47,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 226 conjunts are in the unsatisfiable core [2019-03-04 16:58:47,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:47,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:47,901 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:47,910 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:47,910 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:58:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:50,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:54,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:54,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-03-04 16:58:54,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:54,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-03-04 16:58:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-03-04 16:58:54,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:58:54,669 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-03-04 16:58:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:55,149 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-03-04 16:58:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:58:55,149 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-03-04 16:58:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:55,150 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:58:55,150 INFO L226 Difference]: Without dead ends: 224 [2019-03-04 16:58:55,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 16:58:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-03-04 16:58:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-03-04 16:58:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-03-04 16:58:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-03-04 16:58:55,155 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-03-04 16:58:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:55,156 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-03-04 16:58:55,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-03-04 16:58:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-03-04 16:58:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-03-04 16:58:55,157 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:55,157 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-03-04 16:58:55,157 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-03-04 16:58:55,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:55,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:55,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:55,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:55,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:57,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:57,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:57,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:57,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:57,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:57,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:58:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:57,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:57,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 229 conjunts are in the unsatisfiable core [2019-03-04 16:58:57,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:57,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:58:57,704 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:58:57,715 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:58:57,715 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:00,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:04,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:04,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-03-04 16:59:04,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:04,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-03-04 16:59:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-03-04 16:59:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:59:04,658 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-03-04 16:59:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:05,173 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-03-04 16:59:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:59:05,174 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-03-04 16:59:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:05,175 INFO L225 Difference]: With dead ends: 228 [2019-03-04 16:59:05,175 INFO L226 Difference]: Without dead ends: 227 [2019-03-04 16:59:05,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-03-04 16:59:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-03-04 16:59:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-03-04 16:59:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:59:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-03-04 16:59:05,181 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-03-04 16:59:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:05,181 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-03-04 16:59:05,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-03-04 16:59:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-03-04 16:59:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-03-04 16:59:05,182 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:05,182 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-03-04 16:59:05,183 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-03-04 16:59:05,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:05,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:05,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:07,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:07,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:07,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:07,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:07,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:07,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:59:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:07,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:59:07,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-03-04 16:59:07,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:07,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 232 conjunts are in the unsatisfiable core [2019-03-04 16:59:07,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:07,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:59:07,958 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:07,968 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:07,968 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:10,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:14,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:14,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-03-04 16:59:14,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:14,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-03-04 16:59:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-03-04 16:59:14,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:59:14,834 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-03-04 16:59:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:15,389 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-03-04 16:59:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-03-04 16:59:15,389 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-03-04 16:59:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:15,391 INFO L225 Difference]: With dead ends: 231 [2019-03-04 16:59:15,391 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:59:15,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:59:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:59:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-03-04 16:59:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:59:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-03-04 16:59:15,397 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-03-04 16:59:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:15,397 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-03-04 16:59:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-03-04 16:59:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-03-04 16:59:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-03-04 16:59:15,399 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:15,399 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-03-04 16:59:15,399 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-03-04 16:59:15,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:15,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:15,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:18,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:18,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:18,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:18,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:18,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:18,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:59:18,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:59:18,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:59:18,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:59:18,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:18,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 235 conjunts are in the unsatisfiable core [2019-03-04 16:59:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:18,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:59:18,093 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:18,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:18,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:21,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:25,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:25,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-03-04 16:59:25,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:25,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-03-04 16:59:25,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-03-04 16:59:25,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:59:25,039 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-03-04 16:59:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:25,651 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-03-04 16:59:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-03-04 16:59:25,651 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-03-04 16:59:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:25,653 INFO L225 Difference]: With dead ends: 234 [2019-03-04 16:59:25,653 INFO L226 Difference]: Without dead ends: 233 [2019-03-04 16:59:25,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-03-04 16:59:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-03-04 16:59:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-03-04 16:59:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-03-04 16:59:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-03-04 16:59:25,659 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-03-04 16:59:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:25,659 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-03-04 16:59:25,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-03-04 16:59:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-03-04 16:59:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-03-04 16:59:25,660 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:25,661 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-03-04 16:59:25,661 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-03-04 16:59:25,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:25,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:25,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:28,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:28,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:28,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:28,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:28,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:28,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:59:28,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:28,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:28,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 238 conjunts are in the unsatisfiable core [2019-03-04 16:59:28,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:28,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:59:28,375 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:28,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:28,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:31,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:35,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:35,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-03-04 16:59:35,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:35,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-03-04 16:59:35,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-03-04 16:59:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:59:35,465 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-03-04 16:59:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:35,986 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-03-04 16:59:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-03-04 16:59:35,987 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-03-04 16:59:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:35,988 INFO L225 Difference]: With dead ends: 237 [2019-03-04 16:59:35,988 INFO L226 Difference]: Without dead ends: 236 [2019-03-04 16:59:35,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-03-04 16:59:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-03-04 16:59:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-03-04 16:59:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-03-04 16:59:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-03-04 16:59:35,994 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-03-04 16:59:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:35,994 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-03-04 16:59:35,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-03-04 16:59:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-03-04 16:59:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-03-04 16:59:35,995 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:35,995 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-03-04 16:59:35,995 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:35,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:35,996 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-03-04 16:59:35,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:35,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:38,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:38,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:38,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:38,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:38,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:38,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:59:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:38,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:59:39,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-03-04 16:59:39,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:39,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 241 conjunts are in the unsatisfiable core [2019-03-04 16:59:39,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:39,057 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:59:39,058 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:39,076 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:39,076 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:42,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:46,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:46,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-03-04 16:59:46,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:46,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-03-04 16:59:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-03-04 16:59:46,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:59:46,379 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-03-04 16:59:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:46,990 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-03-04 16:59:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:59:46,990 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-03-04 16:59:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:46,991 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:59:46,991 INFO L226 Difference]: Without dead ends: 239 [2019-03-04 16:59:46,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-03-04 16:59:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-03-04 16:59:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-03-04 16:59:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-03-04 16:59:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-03-04 16:59:46,996 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-03-04 16:59:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:46,996 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-03-04 16:59:46,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-03-04 16:59:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-03-04 16:59:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-03-04 16:59:46,997 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:46,997 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-03-04 16:59:46,997 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-03-04 16:59:46,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:46,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:46,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:49,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:49,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:49,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:49,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:49,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:49,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:59:49,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:59:49,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:59:49,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:59:49,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:49,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 244 conjunts are in the unsatisfiable core [2019-03-04 16:59:49,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:49,863 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:59:49,864 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,875 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:59:49,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 16:59:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:53,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:57,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-03-04 16:59:57,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:57,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-03-04 16:59:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-03-04 16:59:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 16:59:57,086 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-03-04 16:59:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:57,645 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-03-04 16:59:57,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-03-04 16:59:57,646 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-03-04 16:59:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:57,647 INFO L225 Difference]: With dead ends: 243 [2019-03-04 16:59:57,647 INFO L226 Difference]: Without dead ends: 242 [2019-03-04 16:59:57,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-03-04 16:59:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-03-04 16:59:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-03-04 16:59:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:59:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-03-04 16:59:57,654 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-03-04 16:59:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:57,654 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-03-04 16:59:57,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-03-04 16:59:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-03-04 16:59:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:59:57,655 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:57,656 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-03-04 16:59:57,656 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-03-04 16:59:57,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:57,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:57,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:00,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:00,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:00,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:00,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:00,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:00,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:00:00,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:00,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:00,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 247 conjunts are in the unsatisfiable core [2019-03-04 17:00:00,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:00,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:00:00,668 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:00,680 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:00,680 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:04,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:08,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:08,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-03-04 17:00:08,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:08,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-03-04 17:00:08,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-03-04 17:00:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 17:00:08,228 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-03-04 17:00:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:08,798 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-03-04 17:00:08,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-03-04 17:00:08,798 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-03-04 17:00:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:08,799 INFO L225 Difference]: With dead ends: 246 [2019-03-04 17:00:08,799 INFO L226 Difference]: Without dead ends: 245 [2019-03-04 17:00:08,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-03-04 17:00:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-03-04 17:00:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-03-04 17:00:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-03-04 17:00:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-03-04 17:00:08,805 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-03-04 17:00:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:08,806 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-03-04 17:00:08,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-03-04 17:00:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-03-04 17:00:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-03-04 17:00:08,806 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:08,807 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-03-04 17:00:08,807 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-03-04 17:00:08,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:08,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:08,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:08,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:12,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:12,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:12,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:12,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:12,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:12,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:00:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:12,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:12,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-03-04 17:00:12,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:12,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 250 conjunts are in the unsatisfiable core [2019-03-04 17:00:12,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:12,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:00:12,568 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:12,577 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:12,577 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:16,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-03-04 17:00:19,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:19,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-03-04 17:00:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-03-04 17:00:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 17:00:19,999 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-03-04 17:00:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:20,544 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-03-04 17:00:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 17:00:20,544 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-03-04 17:00:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:20,545 INFO L225 Difference]: With dead ends: 249 [2019-03-04 17:00:20,546 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 17:00:20,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-03-04 17:00:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 17:00:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-03-04 17:00:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-03-04 17:00:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-03-04 17:00:20,550 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-03-04 17:00:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:20,550 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-03-04 17:00:20,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-03-04 17:00:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-03-04 17:00:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-03-04 17:00:20,551 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:20,552 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-03-04 17:00:20,552 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-03-04 17:00:20,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:20,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:20,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:23,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:23,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:23,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:23,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:23,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:23,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:00:23,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:23,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:23,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:23,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:23,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 253 conjunts are in the unsatisfiable core [2019-03-04 17:00:23,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:23,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:00:23,563 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:23,572 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:23,572 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:27,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-03-04 17:00:31,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:31,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-03-04 17:00:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-03-04 17:00:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 17:00:31,152 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-03-04 17:00:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:31,713 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-03-04 17:00:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 17:00:31,713 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-03-04 17:00:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:31,714 INFO L225 Difference]: With dead ends: 252 [2019-03-04 17:00:31,714 INFO L226 Difference]: Without dead ends: 251 [2019-03-04 17:00:31,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 17:00:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-03-04 17:00:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-03-04 17:00:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-03-04 17:00:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-03-04 17:00:31,719 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-03-04 17:00:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:31,720 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-03-04 17:00:31,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-03-04 17:00:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-03-04 17:00:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-03-04 17:00:31,720 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:31,721 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-03-04 17:00:31,721 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:31,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-03-04 17:00:31,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:31,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:31,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:34,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:34,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:34,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:34,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:34,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:34,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:00:34,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:34,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:34,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 256 conjunts are in the unsatisfiable core [2019-03-04 17:00:34,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:34,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:00:34,873 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:34,885 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:34,885 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:38,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:42,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:42,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-03-04 17:00:42,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:42,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-03-04 17:00:42,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-03-04 17:00:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 17:00:42,589 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-03-04 17:00:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:43,150 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-03-04 17:00:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-03-04 17:00:43,151 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-03-04 17:00:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:43,152 INFO L225 Difference]: With dead ends: 255 [2019-03-04 17:00:43,152 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 17:00:43,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 17:00:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 17:00:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-03-04 17:00:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-03-04 17:00:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-03-04 17:00:43,157 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-03-04 17:00:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:43,158 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-03-04 17:00:43,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-03-04 17:00:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-03-04 17:00:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-03-04 17:00:43,159 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:43,159 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-03-04 17:00:43,160 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-03-04 17:00:43,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:43,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:43,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:46,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:46,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:46,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:46,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:46,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:46,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:00:46,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:46,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:46,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-03-04 17:00:46,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:46,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 259 conjunts are in the unsatisfiable core [2019-03-04 17:00:46,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:46,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:00:46,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:46,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:46,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:00:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:50,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:54,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-03-04 17:00:54,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:54,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-03-04 17:00:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-03-04 17:00:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 17:00:54,475 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-03-04 17:00:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:55,061 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-03-04 17:00:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 17:00:55,062 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-03-04 17:00:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:55,063 INFO L225 Difference]: With dead ends: 258 [2019-03-04 17:00:55,063 INFO L226 Difference]: Without dead ends: 257 [2019-03-04 17:00:55,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-03-04 17:00:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-03-04 17:00:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-03-04 17:00:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-03-04 17:00:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-03-04 17:00:55,068 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-03-04 17:00:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:55,069 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-03-04 17:00:55,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-03-04 17:00:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-03-04 17:00:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-03-04 17:00:55,070 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:55,070 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-03-04 17:00:55,070 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-03-04 17:00:55,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:55,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:55,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:58,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:58,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:58,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:58,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:58,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:58,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:00:58,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:58,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:58,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:58,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:58,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 262 conjunts are in the unsatisfiable core [2019-03-04 17:00:58,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:58,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:00:58,407 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:00:58,414 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:00:58,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:02,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:06,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:06,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-03-04 17:01:06,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:06,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-03-04 17:01:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-03-04 17:01:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 17:01:06,183 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-03-04 17:01:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:06,816 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-03-04 17:01:06,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-03-04 17:01:06,817 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-03-04 17:01:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:06,818 INFO L225 Difference]: With dead ends: 261 [2019-03-04 17:01:06,818 INFO L226 Difference]: Without dead ends: 260 [2019-03-04 17:01:06,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-03-04 17:01:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-03-04 17:01:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-03-04 17:01:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-03-04 17:01:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-03-04 17:01:06,824 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-03-04 17:01:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:06,824 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-03-04 17:01:06,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-03-04 17:01:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-03-04 17:01:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-03-04 17:01:06,825 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:06,826 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-03-04 17:01:06,826 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-03-04 17:01:06,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:06,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:06,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:10,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:10,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:10,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:10,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:10,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:10,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:01:10,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:10,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 265 conjunts are in the unsatisfiable core [2019-03-04 17:01:10,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:10,298 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:01:10,298 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:10,308 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:10,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:14,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:18,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-03-04 17:01:18,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:18,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-03-04 17:01:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-03-04 17:01:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 17:01:18,195 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-03-04 17:01:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:18,868 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-03-04 17:01:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-03-04 17:01:18,869 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-03-04 17:01:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:18,870 INFO L225 Difference]: With dead ends: 264 [2019-03-04 17:01:18,870 INFO L226 Difference]: Without dead ends: 263 [2019-03-04 17:01:18,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-03-04 17:01:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-03-04 17:01:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-03-04 17:01:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-03-04 17:01:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-03-04 17:01:18,876 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-03-04 17:01:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:18,876 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-03-04 17:01:18,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-03-04 17:01:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-03-04 17:01:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-03-04 17:01:18,878 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:18,878 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-03-04 17:01:18,878 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-03-04 17:01:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:18,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:18,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:22,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:22,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:22,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:22,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:22,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:22,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:01:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:01:22,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:01:22,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-03-04 17:01:22,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:22,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 268 conjunts are in the unsatisfiable core [2019-03-04 17:01:22,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:22,681 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:01:22,681 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:22,697 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:22,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:26,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:30,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-03-04 17:01:30,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:30,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-03-04 17:01:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-03-04 17:01:30,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 17:01:30,704 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-03-04 17:01:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:31,365 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-03-04 17:01:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-03-04 17:01:31,365 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-03-04 17:01:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:31,366 INFO L225 Difference]: With dead ends: 267 [2019-03-04 17:01:31,366 INFO L226 Difference]: Without dead ends: 266 [2019-03-04 17:01:31,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-03-04 17:01:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-03-04 17:01:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-03-04 17:01:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-03-04 17:01:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-03-04 17:01:31,372 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-03-04 17:01:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:31,373 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-03-04 17:01:31,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-03-04 17:01:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-03-04 17:01:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-03-04 17:01:31,374 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:31,375 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-03-04 17:01:31,375 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-03-04 17:01:31,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:31,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:31,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:31,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:31,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:34,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:34,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:34,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:34,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:34,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:34,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:01:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:01:34,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:01:34,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:01:34,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:34,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 271 conjunts are in the unsatisfiable core [2019-03-04 17:01:34,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:34,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:01:34,840 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,850 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:34,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:38,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-03-04 17:01:42,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:42,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-03-04 17:01:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-03-04 17:01:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 17:01:42,872 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-03-04 17:01:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:43,487 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-03-04 17:01:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-03-04 17:01:43,487 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-03-04 17:01:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:43,489 INFO L225 Difference]: With dead ends: 270 [2019-03-04 17:01:43,489 INFO L226 Difference]: Without dead ends: 269 [2019-03-04 17:01:43,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-03-04 17:01:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-03-04 17:01:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-03-04 17:01:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-03-04 17:01:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-03-04 17:01:43,497 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-03-04 17:01:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:43,497 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-03-04 17:01:43,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-03-04 17:01:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-03-04 17:01:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-03-04 17:01:43,499 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:43,499 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-03-04 17:01:43,499 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-03-04 17:01:43,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:43,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:43,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:47,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:47,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:47,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:47,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:47,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:01:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:47,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:47,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 274 conjunts are in the unsatisfiable core [2019-03-04 17:01:47,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:47,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:01:47,098 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:01:47,108 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:01:47,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:01:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:51,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:55,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:55,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-03-04 17:01:55,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:55,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-03-04 17:01:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-03-04 17:01:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 17:01:55,251 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-03-04 17:01:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:56,073 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-03-04 17:01:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 17:01:56,073 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-03-04 17:01:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:56,074 INFO L225 Difference]: With dead ends: 273 [2019-03-04 17:01:56,074 INFO L226 Difference]: Without dead ends: 272 [2019-03-04 17:01:56,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-03-04 17:01:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-03-04 17:01:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-03-04 17:01:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-03-04 17:01:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-03-04 17:01:56,080 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-03-04 17:01:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:56,080 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-03-04 17:01:56,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-03-04 17:01:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-03-04 17:01:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-03-04 17:01:56,081 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:56,081 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-03-04 17:01:56,081 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-03-04 17:01:56,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:56,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:56,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:59,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:59,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:59,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:59,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:59,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:59,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:01:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:01:59,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:02:00,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-03-04 17:02:00,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:00,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 277 conjunts are in the unsatisfiable core [2019-03-04 17:02:00,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:00,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:02:00,148 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:00,156 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:00,157 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:04,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:08,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:08,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-03-04 17:02:08,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:08,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-03-04 17:02:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-03-04 17:02:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 17:02:08,423 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-03-04 17:02:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:09,133 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-03-04 17:02:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-03-04 17:02:09,134 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-03-04 17:02:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:09,135 INFO L225 Difference]: With dead ends: 276 [2019-03-04 17:02:09,136 INFO L226 Difference]: Without dead ends: 275 [2019-03-04 17:02:09,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-03-04 17:02:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-03-04 17:02:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-03-04 17:02:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-03-04 17:02:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-03-04 17:02:09,142 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-03-04 17:02:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:09,142 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-03-04 17:02:09,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-03-04 17:02:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-03-04 17:02:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-03-04 17:02:09,143 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:09,143 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-03-04 17:02:09,143 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-03-04 17:02:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:09,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:09,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:12,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:12,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:12,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:12,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:12,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:12,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:02:12,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:02:12,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:02:12,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:02:12,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:12,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 280 conjunts are in the unsatisfiable core [2019-03-04 17:02:12,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:12,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:02:12,907 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:12,917 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:12,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:17,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:21,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-03-04 17:02:21,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-03-04 17:02:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-03-04 17:02:21,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-03-04 17:02:21,250 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-03-04 17:02:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:21,969 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-03-04 17:02:21,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 17:02:21,969 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-03-04 17:02:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:21,970 INFO L225 Difference]: With dead ends: 279 [2019-03-04 17:02:21,971 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 17:02:21,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-03-04 17:02:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 17:02:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-03-04 17:02:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-03-04 17:02:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-03-04 17:02:21,977 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-03-04 17:02:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:21,977 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-03-04 17:02:21,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-03-04 17:02:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-03-04 17:02:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-03-04 17:02:21,978 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:21,978 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-03-04 17:02:21,978 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-03-04 17:02:21,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:21,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:21,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:25,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:25,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:25,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:25,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:25,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:25,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:02:25,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:25,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:02:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:25,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 283 conjunts are in the unsatisfiable core [2019-03-04 17:02:25,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:25,788 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:02:25,788 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:25,797 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:25,797 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:30,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:34,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:34,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-03-04 17:02:34,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:34,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-03-04 17:02:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-03-04 17:02:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 17:02:34,437 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-03-04 17:02:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:35,091 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-03-04 17:02:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-03-04 17:02:35,091 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-03-04 17:02:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:35,093 INFO L225 Difference]: With dead ends: 282 [2019-03-04 17:02:35,093 INFO L226 Difference]: Without dead ends: 281 [2019-03-04 17:02:35,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 17:02:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-03-04 17:02:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-03-04 17:02:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-03-04 17:02:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-03-04 17:02:35,098 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-03-04 17:02:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:35,099 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-03-04 17:02:35,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-03-04 17:02:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-03-04 17:02:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-03-04 17:02:35,100 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:35,100 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-03-04 17:02:35,100 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-03-04 17:02:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:35,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:39,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:39,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:39,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:39,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:39,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:39,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:02:39,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:02:39,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:02:39,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-03-04 17:02:39,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:39,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 286 conjunts are in the unsatisfiable core [2019-03-04 17:02:39,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:39,646 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:02:39,646 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:39,653 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:39,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:44,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:48,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:48,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-03-04 17:02:48,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:48,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-03-04 17:02:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-03-04 17:02:48,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 17:02:48,264 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-03-04 17:02:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:49,020 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-03-04 17:02:49,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 17:02:49,021 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-03-04 17:02:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:49,022 INFO L225 Difference]: With dead ends: 285 [2019-03-04 17:02:49,023 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 17:02:49,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 17:02:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 17:02:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-03-04 17:02:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-03-04 17:02:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-03-04 17:02:49,028 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-03-04 17:02:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:49,028 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-03-04 17:02:49,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-03-04 17:02:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-03-04 17:02:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-03-04 17:02:49,029 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:49,029 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-03-04 17:02:49,029 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-03-04 17:02:49,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:49,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:49,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:52,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:52,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:52,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:52,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:52,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:52,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:02:52,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:02:52,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:02:52,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:02:52,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:52,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 289 conjunts are in the unsatisfiable core [2019-03-04 17:02:52,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:52,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:02:52,958 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:02:52,971 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:02:52,971 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:02:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:57,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:01,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:01,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-03-04 17:03:01,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:01,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-03-04 17:03:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-03-04 17:03:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 17:03:01,677 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2019-03-04 17:03:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:02,504 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-03-04 17:03:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-03-04 17:03:02,505 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2019-03-04 17:03:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:02,506 INFO L225 Difference]: With dead ends: 288 [2019-03-04 17:03:02,506 INFO L226 Difference]: Without dead ends: 287 [2019-03-04 17:03:02,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 17:03:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-03-04 17:03:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-03-04 17:03:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-03-04 17:03:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-03-04 17:03:02,512 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-03-04 17:03:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:02,512 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-03-04 17:03:02,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-03-04 17:03:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-03-04 17:03:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-03-04 17:03:02,513 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:02,513 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2019-03-04 17:03:02,513 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2019-03-04 17:03:02,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:02,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:02,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:06,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:06,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:06,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:06,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:06,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:06,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:03:06,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:06,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:06,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 292 conjunts are in the unsatisfiable core [2019-03-04 17:03:06,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:06,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:03:06,477 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:06,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:06,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:11,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:15,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:15,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-03-04 17:03:15,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:15,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-03-04 17:03:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-03-04 17:03:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 17:03:15,276 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2019-03-04 17:03:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:15,934 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-03-04 17:03:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-03-04 17:03:15,934 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2019-03-04 17:03:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:15,936 INFO L225 Difference]: With dead ends: 291 [2019-03-04 17:03:15,936 INFO L226 Difference]: Without dead ends: 290 [2019-03-04 17:03:15,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 17:03:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-03-04 17:03:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-03-04 17:03:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-03-04 17:03:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-03-04 17:03:15,942 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-03-04 17:03:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:15,943 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-03-04 17:03:15,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-03-04 17:03:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-03-04 17:03:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-03-04 17:03:15,944 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:15,944 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2019-03-04 17:03:15,944 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2019-03-04 17:03:15,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:15,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:15,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:19,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:19,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:19,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:19,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:19,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:19,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:03:19,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:03:19,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:03:20,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-03-04 17:03:20,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:20,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 295 conjunts are in the unsatisfiable core [2019-03-04 17:03:20,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:20,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:03:20,547 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:20,556 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:20,556 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:25,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:29,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-03-04 17:03:29,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:29,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-03-04 17:03:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-03-04 17:03:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 17:03:29,459 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2019-03-04 17:03:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:30,217 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-03-04 17:03:30,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-03-04 17:03:30,217 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2019-03-04 17:03:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:30,219 INFO L225 Difference]: With dead ends: 294 [2019-03-04 17:03:30,219 INFO L226 Difference]: Without dead ends: 293 [2019-03-04 17:03:30,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-03-04 17:03:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-03-04 17:03:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-03-04 17:03:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-03-04 17:03:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-03-04 17:03:30,226 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-03-04 17:03:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:30,226 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-03-04 17:03:30,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-03-04 17:03:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-03-04 17:03:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-03-04 17:03:30,228 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:30,228 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2019-03-04 17:03:30,228 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2019-03-04 17:03:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:30,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:30,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:34,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:34,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:34,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:34,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:34,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:34,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:03:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:03:34,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:03:34,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:03:34,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 298 conjunts are in the unsatisfiable core [2019-03-04 17:03:34,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:34,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:03:34,415 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:34,424 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:34,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:39,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:43,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:43,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-03-04 17:03:43,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:43,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-03-04 17:03:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-03-04 17:03:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-03-04 17:03:43,484 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2019-03-04 17:03:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:44,130 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-03-04 17:03:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 17:03:44,130 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2019-03-04 17:03:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:44,133 INFO L225 Difference]: With dead ends: 297 [2019-03-04 17:03:44,133 INFO L226 Difference]: Without dead ends: 296 [2019-03-04 17:03:44,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-03-04 17:03:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-03-04 17:03:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-03-04 17:03:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-03-04 17:03:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-03-04 17:03:44,140 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-03-04 17:03:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:44,140 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-03-04 17:03:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-03-04 17:03:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-03-04 17:03:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-03-04 17:03:44,142 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:44,142 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2019-03-04 17:03:44,142 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:44,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2019-03-04 17:03:44,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:44,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:44,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:48,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:48,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:48,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:48,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:48,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:48,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:03:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:48,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:48,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 301 conjunts are in the unsatisfiable core [2019-03-04 17:03:48,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:48,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:03:48,395 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:03:48,403 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:03:48,403 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:03:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:53,476 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:57,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:57,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-03-04 17:03:57,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:57,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-03-04 17:03:57,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-03-04 17:03:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 17:03:57,609 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2019-03-04 17:03:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:58,437 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-03-04 17:03:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-03-04 17:03:58,437 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2019-03-04 17:03:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:58,438 INFO L225 Difference]: With dead ends: 300 [2019-03-04 17:03:58,439 INFO L226 Difference]: Without dead ends: 299 [2019-03-04 17:03:58,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-03-04 17:03:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-03-04 17:03:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-03-04 17:03:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-03-04 17:03:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-03-04 17:03:58,444 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-03-04 17:03:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:58,444 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-03-04 17:03:58,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-03-04 17:03:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-03-04 17:03:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-03-04 17:03:58,445 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:58,445 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2019-03-04 17:03:58,445 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2019-03-04 17:03:58,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:58,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:02,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:02,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:02,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:02,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:02,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:02,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:04:02,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:04:02,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:04:03,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-03-04 17:04:03,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:03,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 304 conjunts are in the unsatisfiable core [2019-03-04 17:04:03,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:03,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:04:03,305 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:03,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:03,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:08,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:12,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:12,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-03-04 17:04:12,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:12,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-03-04 17:04:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-03-04 17:04:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-03-04 17:04:12,557 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2019-03-04 17:04:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:13,381 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-03-04 17:04:13,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-03-04 17:04:13,381 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2019-03-04 17:04:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:13,382 INFO L225 Difference]: With dead ends: 303 [2019-03-04 17:04:13,383 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 17:04:13,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-03-04 17:04:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 17:04:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-03-04 17:04:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-03-04 17:04:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-03-04 17:04:13,388 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-03-04 17:04:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:13,388 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-03-04 17:04:13,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-03-04 17:04:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-03-04 17:04:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-03-04 17:04:13,390 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:13,390 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2019-03-04 17:04:13,390 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2019-03-04 17:04:13,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:13,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:13,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:13,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:13,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:17,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:17,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:17,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:17,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:17,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:17,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 17:04:17,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:04:17,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:04:18,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:04:18,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:18,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 307 conjunts are in the unsatisfiable core [2019-03-04 17:04:18,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:18,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 17:04:18,069 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 17:04:18,075 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 17:04:18,076 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-03-04 17:04:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:23,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-03-04 17:04:27,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:27,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-03-04 17:04:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-03-04 17:04:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 17:04:27,300 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2019-03-04 17:04:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:28,035 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-03-04 17:04:28,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 17:04:28,036 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2019-03-04 17:04:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:28,038 INFO L225 Difference]: With dead ends: 306 [2019-03-04 17:04:28,038 INFO L226 Difference]: Without dead ends: 305 [2019-03-04 17:04:28,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-03-04 17:04:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-03-04 17:04:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-03-04 17:04:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-03-04 17:04:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-03-04 17:04:28,044 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-03-04 17:04:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:28,044 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-03-04 17:04:28,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-03-04 17:04:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-03-04 17:04:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-03-04 17:04:28,046 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:28,046 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2019-03-04 17:04:28,046 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2019-03-04 17:04:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:28,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:28,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:32,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:32,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:32,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:32,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:32,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:32,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:04:32,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:04:32,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:04:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:32,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 102 conjunts are in the unsatisfiable core [2019-03-04 17:04:32,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:32,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-03-04 17:04:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2019-03-04 17:04:36,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 17:04:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-03-04 17:04:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-03-04 17:04:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 17:04:36,725 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2019-03-04 17:04:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:37,409 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-03-04 17:04:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 17:04:37,409 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2019-03-04 17:04:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:37,410 INFO L225 Difference]: With dead ends: 306 [2019-03-04 17:04:37,410 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 17:04:37,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 17:04:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 17:04:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 17:04:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 17:04:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 17:04:37,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-03-04 17:04:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:37,414 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 17:04:37,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-03-04 17:04:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 17:04:37,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 17:04:37,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 17:04:37,548 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-03-04 17:04:40,480 WARN L181 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-03-04 17:04:40,487 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2019-03-04 17:04:40,487 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2019-03-04 17:04:40,487 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-03-04 17:04:40,487 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-03-04 17:04:40,489 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-03-04 17:04:40,489 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2019-03-04 17:04:40,489 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2019-03-04 17:04:40,527 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 05:04:40 BoogieIcfgContainer [2019-03-04 17:04:40,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 17:04:40,528 INFO L168 Benchmark]: Toolchain (without parser) took 697498.97 ms. Allocated memory was 134.2 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 109.6 MB in the beginning and 973.1 MB in the end (delta: -863.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-03-04 17:04:40,529 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 17:04:40,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 17:04:40,529 INFO L168 Benchmark]: Boogie Preprocessor took 23.64 ms. Allocated memory is still 134.2 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 17:04:40,530 INFO L168 Benchmark]: RCFGBuilder took 352.29 ms. Allocated memory is still 134.2 MB. Free memory was 105.8 MB in the beginning and 95.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-03-04 17:04:40,530 INFO L168 Benchmark]: TraceAbstraction took 697059.78 ms. Allocated memory was 134.2 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 95.7 MB in the beginning and 973.1 MB in the end (delta: -877.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-03-04 17:04:40,532 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.64 ms. Allocated memory is still 134.2 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 352.29 ms. Allocated memory is still 134.2 MB. Free memory was 105.8 MB in the beginning and 95.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 697059.78 ms. Allocated memory was 134.2 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 95.7 MB in the beginning and 973.1 MB in the end (delta: -877.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 696.9s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 39.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 601.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 12.5s SatisfiabilityAnalysisTime, 625.5s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...