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/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:21:02,061 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:21:02,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:21:02,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:21:02,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:21:02,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:21:02,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:21:02,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:21:02,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:21:02,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:21:02,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:21:02,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:21:02,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:21:02,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:21:02,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:21:02,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:21:02,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:21:02,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:21:02,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:21:02,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:21:02,097 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:21:02,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:21:02,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:21:02,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:21:02,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:21:02,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:21:02,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:21:02,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:21:02,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:21:02,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:21:02,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:21:02,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:21:02,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:21:02,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:21:02,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:21:02,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:21:02,110 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-01-31 17:21:02,124 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:21:02,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:21:02,125 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:21:02,125 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:21:02,125 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:21:02,125 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:21:02,126 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:21:02,126 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:21:02,126 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:21:02,126 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:21:02,126 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:21:02,127 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:21:02,127 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:21:02,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:21:02,128 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:21:02,128 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:21:02,128 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:21:02,128 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:21:02,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:21:02,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:21:02,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:21:02,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:21:02,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:21:02,129 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:21:02,130 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:21:02,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:21:02,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:21:02,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:21:02,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:21:02,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:21:02,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:21:02,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:21:02,132 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:21:02,132 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:21:02,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:21:02,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:21:02,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:21:02,133 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:21:02,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:21:02,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:21:02,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:21:02,183 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:21:02,183 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:21:02,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-01-31 17:21:02,184 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-01-31 17:21:02,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:21:02,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:21:02,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:21:02,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:21:02,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:21:02,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:21:02,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:21:02,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:21:02,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:21:02,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:21:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:21:02,641 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:21:02,642 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-31 17:21:02,644 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02 BoogieIcfgContainer [2019-01-31 17:21:02,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:21:02,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:21:02,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:21:02,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:21:02,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/2) ... [2019-01-31 17:21:02,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5293af1a and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:21:02, skipping insertion in model container [2019-01-31 17:21:02,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02" (2/2) ... [2019-01-31 17:21:02,654 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-01-31 17:21:02,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:21:02,674 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 17:21:02,690 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 17:21:02,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:21:02,726 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:21:02,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:21:02,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:21:02,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:21:02,727 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:21:02,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:21:02,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:21:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 17:21:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:21:02,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:02,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:21:02,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-31 17:21:02,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:02,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:02,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:02,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:21:02,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:02,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:21:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:21:02,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:21:02,959 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 17:21:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:03,073 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 17:21:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:21:03,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:21:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:03,107 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:21:03,108 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 17:21:03,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:21:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 17:21:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 17:21:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 17:21:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 17:21:03,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-31 17:21:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:03,158 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 17:21:03,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:21:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 17:21:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:21:03,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:03,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:21:03,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-31 17:21:03,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:03,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:21:03,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:03,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:03,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:21:03,238 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-31 17:21:03,301 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:03,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:06,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:06,413 INFO L272 AbstractInterpreter]: Visited 6 different actions 50 times. Merged at 4 different actions 28 times. Widened at 2 different actions 12 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:21:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:06,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:06,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:21:06,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:21:06,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:06,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 17:21:06,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:06,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:06,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:06,741 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-31 17:21:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,828 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-31 17:21:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:21:06,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-31 17:21:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,829 INFO L225 Difference]: With dead ends: 13 [2019-01-31 17:21:06,829 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 17:21:06,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 17:21:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 17:21:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:21:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-31 17:21:06,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-31 17:21:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,834 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-31 17:21:06,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-31 17:21:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:21:06,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,835 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-31 17:21:06,836 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-31 17:21:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:21:06,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:06,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:06,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:06,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:06,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:06,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:06,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:21:06,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:06,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:21:07,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:21:07,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:07,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-31 17:21:07,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:07,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:21:07,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:21:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:07,514 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-31 17:21:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:07,722 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-31 17:21:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:21:07,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 17:21:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:07,723 INFO L225 Difference]: With dead ends: 16 [2019-01-31 17:21:07,724 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:21:07,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:21:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 17:21:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:21:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-31 17:21:07,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-31 17:21:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:07,728 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-31 17:21:07,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:21:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-31 17:21:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:21:07,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:07,729 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-31 17:21:07,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-31 17:21:07,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:07,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:21:07,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:07,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:07,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:07,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:07,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:07,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:07,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:07,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:07,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:21:07,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:21:08,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 17:21:08,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:21:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:21:08,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:08,229 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-31 17:21:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:08,369 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-31 17:21:08,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:21:08,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-31 17:21:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:08,370 INFO L225 Difference]: With dead ends: 19 [2019-01-31 17:21:08,371 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 17:21:08,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 17:21:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 17:21:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:21:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-31 17:21:08,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-31 17:21:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:08,375 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-31 17:21:08,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:21:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-31 17:21:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 17:21:08,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:08,376 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-31 17:21:08,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-31 17:21:08,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-31 17:21:08,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:08,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:08,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:08,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:08,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:08,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-31 17:21:08,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-31 17:21:08,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-31 17:21:08,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:21:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:21:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:08,751 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-31 17:21:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:08,870 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-31 17:21:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:21:08,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-31 17:21:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:08,872 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:21:08,872 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 17:21:08,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 17:21:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 17:21:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 17:21:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-31 17:21:08,876 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-31 17:21:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:08,876 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-31 17:21:08,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:21:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-31 17:21:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 17:21:08,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:08,877 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-31 17:21:08,877 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:08,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-31 17:21:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-31 17:21:09,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:09,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:09,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:09,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:21:09,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:09,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-31 17:21:09,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-31 17:21:09,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-31 17:21:09,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:21:09,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:21:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:09,494 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-31 17:21:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:09,568 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-31 17:21:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:21:09,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-31 17:21:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:09,569 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:21:09,570 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:21:09,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:21:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:21:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:21:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-31 17:21:09,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-31 17:21:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:09,575 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-31 17:21:09,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:21:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-31 17:21:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 17:21:09,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:09,576 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-31 17:21:09,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-31 17:21:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-31 17:21:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:09,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:09,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:09,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:09,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-31 17:21:09,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-31 17:21:09,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-31 17:21:09,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:21:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:21:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:09,935 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-31 17:21:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:10,010 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-31 17:21:10,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:21:10,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-31 17:21:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:10,012 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:21:10,012 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:21:10,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:21:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 17:21:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 17:21:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-31 17:21:10,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-31 17:21:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:10,018 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-31 17:21:10,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:21:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-31 17:21:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 17:21:10,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:10,019 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-31 17:21:10,019 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:10,020 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-31 17:21:10,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:10,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:10,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-31 17:21:10,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:10,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:10,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:10,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:10,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:10,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:10,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-31 17:21:10,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-31 17:21:10,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:10,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-31 17:21:10,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:10,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:21:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:21:10,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:10,515 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-31 17:21:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:10,560 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-31 17:21:10,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:21:10,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-31 17:21:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:10,564 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:21:10,564 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:21:10,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:21:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 17:21:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:21:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-31 17:21:10,568 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-31 17:21:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:10,568 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-31 17:21:10,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:21:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-31 17:21:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 17:21:10,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:10,569 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-31 17:21:10,569 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-31 17:21:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-31 17:21:10,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:10,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:10,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:10,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:10,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:10,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 17:21:10,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:10,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-31 17:21:10,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-31 17:21:11,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:11,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-31 17:21:11,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:11,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:21:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:21:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:21:11,023 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-31 17:21:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:11,256 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-31 17:21:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:21:11,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-31 17:21:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:11,258 INFO L225 Difference]: With dead ends: 34 [2019-01-31 17:21:11,258 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:21:11,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:21:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:21:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 17:21:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:21:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-31 17:21:11,264 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-31 17:21:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:11,264 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-31 17:21:11,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:21:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-31 17:21:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 17:21:11,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:11,265 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-31 17:21:11,265 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-31 17:21:11,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-31 17:21:11,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:11,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:11,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:11,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:11,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:11,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:11,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:11,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-31 17:21:11,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-31 17:21:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-31 17:21:11,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:11,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:21:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:21:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:11,927 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-31 17:21:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:11,989 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-31 17:21:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:21:11,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-31 17:21:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:11,993 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:21:11,993 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 17:21:11,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 17:21:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 17:21:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:21:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-31 17:21:11,998 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-31 17:21:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:11,998 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-31 17:21:11,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:21:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-31 17:21:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 17:21:11,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:11,999 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-31 17:21:11,999 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-31 17:21:12,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-31 17:21:12,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:12,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:12,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:12,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:12,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-31 17:21:12,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-31 17:21:12,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:12,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-31 17:21:12,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:12,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:21:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:21:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:21:12,723 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-31 17:21:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:12,790 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-31 17:21:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:21:12,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-31 17:21:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:12,794 INFO L225 Difference]: With dead ends: 40 [2019-01-31 17:21:12,794 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 17:21:12,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:21:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 17:21:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 17:21:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 17:21:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-31 17:21:12,799 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-31 17:21:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:12,799 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-31 17:21:12,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:21:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-31 17:21:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 17:21:12,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:12,800 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-31 17:21:12,801 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-31 17:21:12,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:12,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-31 17:21:13,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:13,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:13,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:13,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:13,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:13,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:13,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:13,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:13,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 17:21:13,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:13,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:13,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:21:13,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:13,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:13,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-31 17:21:14,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-01-31 17:21:14,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:21:14,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:14,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-01-31 17:21:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-31 17:21:14,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-31 17:21:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-01-31 17:21:14,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:14,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 17:21:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 17:21:14,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:14,750 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-01-31 17:21:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:20,305 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-31 17:21:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 17:21:20,306 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-01-31 17:21:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:20,306 INFO L225 Difference]: With dead ends: 43 [2019-01-31 17:21:20,306 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:21:20,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-01-31 17:21:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:21:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 17:21:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:21:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-31 17:21:20,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-31 17:21:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:20,313 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-31 17:21:20,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 17:21:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-31 17:21:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 17:21:20,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:20,317 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-31 17:21:20,318 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-31 17:21:20,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:20,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:20,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-31 17:21:20,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:20,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:20,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:20,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:20,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:20,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:20,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:20,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:20,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:20,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:20,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-31 17:21:20,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-31 17:21:21,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:21,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-31 17:21:21,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:21,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 17:21:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 17:21:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:21,133 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-31 17:21:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:21,238 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-31 17:21:21,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 17:21:21,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-31 17:21:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:21,239 INFO L225 Difference]: With dead ends: 46 [2019-01-31 17:21:21,240 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:21:21,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:21:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 17:21:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:21:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-31 17:21:21,246 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-31 17:21:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:21,246 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-31 17:21:21,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 17:21:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-31 17:21:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 17:21:21,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:21,247 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-31 17:21:21,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-31 17:21:21,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-31 17:21:21,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:21,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:21,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:21,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:21,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:21,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:21,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:21,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-31 17:21:21,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-31 17:21:21,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:21,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-31 17:21:21,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:21,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 17:21:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 17:21:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 17:21:21,808 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-31 17:21:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:21,886 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-31 17:21:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 17:21:21,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-31 17:21:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:21,887 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:21:21,887 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:21:21,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 17:21:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:21:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 17:21:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:21:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-31 17:21:21,895 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-31 17:21:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:21,895 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-31 17:21:21,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 17:21:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-31 17:21:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 17:21:21,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:21,896 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-31 17:21:21,897 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-31 17:21:21,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:21,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-31 17:21:22,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:22,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:22,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:22,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:22,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:22,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:22,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 17:21:22,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:22,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-31 17:21:22,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-31 17:21:23,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:23,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-01-31 17:21:23,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:23,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 17:21:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 17:21:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:21:23,093 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-31 17:21:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:23,162 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-31 17:21:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 17:21:23,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-31 17:21:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:23,164 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:21:23,164 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:21:23,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:21:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:21:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 17:21:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:21:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-31 17:21:23,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-31 17:21:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:23,171 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-31 17:21:23,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 17:21:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-31 17:21:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 17:21:23,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:23,172 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-31 17:21:23,172 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-31 17:21:23,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:23,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:23,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-31 17:21:23,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:23,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:23,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:23,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:23,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:23,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:23,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:23,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:23,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:23,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-31 17:21:23,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-31 17:21:24,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:24,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-31 17:21:24,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 17:21:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 17:21:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:24,896 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-31 17:21:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:25,202 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-31 17:21:25,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 17:21:25,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-31 17:21:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:25,204 INFO L225 Difference]: With dead ends: 55 [2019-01-31 17:21:25,204 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:21:25,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:21:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 17:21:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:21:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-31 17:21:25,210 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-31 17:21:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:25,210 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-31 17:21:25,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 17:21:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-31 17:21:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 17:21:25,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:25,211 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-31 17:21:25,211 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-31 17:21:25,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:25,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:25,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:25,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:25,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-31 17:21:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:25,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:25,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:25,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:25,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:25,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-31 17:21:25,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-31 17:21:26,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:26,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-31 17:21:26,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:26,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 17:21:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 17:21:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:26,441 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-31 17:21:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:26,516 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-31 17:21:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 17:21:26,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-31 17:21:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:26,518 INFO L225 Difference]: With dead ends: 58 [2019-01-31 17:21:26,518 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 17:21:26,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 17:21:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 17:21:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:21:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-31 17:21:26,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-31 17:21:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:26,526 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-31 17:21:26,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 17:21:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-31 17:21:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 17:21:26,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:26,527 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-31 17:21:26,527 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-31 17:21:26,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:26,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:26,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-31 17:21:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:27,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:27,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:27,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:27,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:27,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:27,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:27,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 17:21:27,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:27,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-31 17:21:27,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-31 17:21:27,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:27,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-31 17:21:27,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:27,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 17:21:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 17:21:27,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:21:27,668 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-31 17:21:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:27,748 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-31 17:21:27,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 17:21:27,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-31 17:21:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:27,749 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:21:27,749 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:21:27,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:21:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:21:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 17:21:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:21:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-31 17:21:27,756 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-31 17:21:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:27,757 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-31 17:21:27,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 17:21:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-31 17:21:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 17:21:27,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:27,758 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-31 17:21:27,758 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-31 17:21:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:27,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:27,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-31 17:21:28,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:28,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:28,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:28,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:28,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:28,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:28,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:28,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:28,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-31 17:21:28,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-31 17:21:28,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:28,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-31 17:21:28,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:28,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 17:21:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 17:21:28,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:28,518 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-31 17:21:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:28,714 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-31 17:21:28,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 17:21:28,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-31 17:21:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:28,716 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:21:28,719 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 17:21:28,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 17:21:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 17:21:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 17:21:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-31 17:21:28,724 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-31 17:21:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:28,725 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-31 17:21:28,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 17:21:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-31 17:21:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 17:21:28,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:28,726 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-31 17:21:28,726 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-31 17:21:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:28,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:28,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-31 17:21:28,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:28,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:28,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:28,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:28,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:28,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:28,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:29,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-31 17:21:29,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-31 17:21:29,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-31 17:21:29,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:29,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 17:21:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 17:21:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:21:29,596 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-31 17:21:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:29,669 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-31 17:21:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 17:21:29,669 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-31 17:21:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:29,671 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:21:29,671 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:21:29,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:21:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:21:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 17:21:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 17:21:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-31 17:21:29,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-31 17:21:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:29,679 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-31 17:21:29,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 17:21:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-31 17:21:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 17:21:29,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:29,680 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-31 17:21:29,680 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:29,680 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-31 17:21:29,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:29,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:29,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:29,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:29,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-31 17:21:29,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:29,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:29,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:29,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:29,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:29,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:30,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:30,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:30,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 17:21:30,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:30,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-31 17:21:30,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-31 17:21:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:30,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-31 17:21:30,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:30,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 17:21:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 17:21:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:21:30,894 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-31 17:21:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:31,001 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-31 17:21:31,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 17:21:31,001 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-31 17:21:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:31,002 INFO L225 Difference]: With dead ends: 70 [2019-01-31 17:21:31,003 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:21:31,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:21:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:21:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 17:21:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:21:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-31 17:21:31,009 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-31 17:21:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:31,009 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-31 17:21:31,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 17:21:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-31 17:21:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 17:21:31,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:31,010 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-31 17:21:31,011 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-31 17:21:31,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:31,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:31,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-31 17:21:31,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:31,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:31,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:31,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:31,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:31,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:31,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:31,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:31,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:31,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:31,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-31 17:21:31,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-31 17:21:32,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:32,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-31 17:21:32,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:32,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 17:21:32,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 17:21:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:32,108 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-31 17:21:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:32,196 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-31 17:21:32,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 17:21:32,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-31 17:21:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:32,199 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:21:32,199 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 17:21:32,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 17:21:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 17:21:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 17:21:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-31 17:21:32,205 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-31 17:21:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:32,205 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-31 17:21:32,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 17:21:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-31 17:21:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 17:21:32,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:32,206 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-31 17:21:32,206 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-31 17:21:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:32,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:32,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-31 17:21:32,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:32,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:32,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:32,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:32,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:32,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:32,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:32,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:32,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-31 17:21:32,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-31 17:21:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:33,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-31 17:21:33,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:33,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 17:21:33,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 17:21:33,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 17:21:33,250 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-31 17:21:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:33,335 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-31 17:21:33,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 17:21:33,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-31 17:21:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:33,337 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:21:33,337 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:21:33,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 17:21:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:21:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 17:21:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:21:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-31 17:21:33,343 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-31 17:21:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:33,343 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-31 17:21:33,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 17:21:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-31 17:21:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 17:21:33,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:33,344 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-31 17:21:33,345 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-31 17:21:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:33,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-31 17:21:33,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:33,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:33,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:33,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:33,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:33,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:33,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:33,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 17:21:33,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:33,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-31 17:21:33,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-31 17:21:35,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:35,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-01-31 17:21:35,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:35,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 17:21:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 17:21:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:21:35,220 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-31 17:21:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:35,313 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-31 17:21:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 17:21:35,314 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-31 17:21:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:35,315 INFO L225 Difference]: With dead ends: 79 [2019-01-31 17:21:35,315 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:21:35,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:21:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:21:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 17:21:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:21:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-31 17:21:35,322 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-31 17:21:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:35,322 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-31 17:21:35,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 17:21:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-31 17:21:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 17:21:35,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:35,323 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-31 17:21:35,324 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:35,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-31 17:21:35,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:35,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:35,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-31 17:21:36,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:36,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:36,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:36,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:36,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:36,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:36,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:36,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:36,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:36,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:36,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-31 17:21:36,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-31 17:21:37,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:37,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-31 17:21:37,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 17:21:37,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 17:21:37,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:37,040 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-31 17:21:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:37,234 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-31 17:21:37,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 17:21:37,235 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-31 17:21:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:37,236 INFO L225 Difference]: With dead ends: 82 [2019-01-31 17:21:37,236 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:21:37,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:21:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 17:21:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:21:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-31 17:21:37,242 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-31 17:21:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:37,242 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-31 17:21:37,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 17:21:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-31 17:21:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 17:21:37,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:37,243 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-31 17:21:37,243 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-31 17:21:37,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:37,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:37,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:37,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:37,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-31 17:21:37,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:37,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:37,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:37,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:37,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:37,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:37,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:37,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:37,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-31 17:21:37,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-31 17:21:38,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:38,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-31 17:21:38,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:38,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 17:21:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 17:21:38,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 17:21:38,545 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-31 17:21:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:38,634 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-31 17:21:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 17:21:38,635 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-31 17:21:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:38,636 INFO L225 Difference]: With dead ends: 85 [2019-01-31 17:21:38,636 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:21:38,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 17:21:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:21:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 17:21:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 17:21:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-31 17:21:38,641 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-31 17:21:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:38,641 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-31 17:21:38,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 17:21:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-31 17:21:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 17:21:38,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:38,642 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-31 17:21:38,642 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:38,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-31 17:21:38,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:38,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:38,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:38,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:38,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-31 17:21:39,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:39,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:39,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:39,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:39,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:39,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:39,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:39,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 17:21:39,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:39,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-31 17:21:39,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-31 17:21:40,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:40,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-01-31 17:21:40,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:40,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 17:21:40,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 17:21:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 17:21:40,425 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-31 17:21:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:40,495 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-31 17:21:40,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 17:21:40,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-31 17:21:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:40,496 INFO L225 Difference]: With dead ends: 88 [2019-01-31 17:21:40,496 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 17:21:40,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 17:21:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 17:21:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 17:21:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:21:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-31 17:21:40,501 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-31 17:21:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:40,501 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-31 17:21:40,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 17:21:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-31 17:21:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 17:21:40,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:40,502 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-31 17:21:40,503 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-31 17:21:40,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:40,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:40,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:40,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:40,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-31 17:21:41,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:41,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:41,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:41,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:41,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:41,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:41,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:41,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:41,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:41,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:41,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-31 17:21:41,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-31 17:21:42,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:42,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-31 17:21:42,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:42,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 17:21:42,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 17:21:42,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:42,199 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-31 17:21:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:42,326 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-31 17:21:42,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 17:21:42,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-31 17:21:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:42,327 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:21:42,327 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:21:42,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:21:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 17:21:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:21:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-31 17:21:42,331 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-31 17:21:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:42,332 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-31 17:21:42,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 17:21:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-31 17:21:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 17:21:42,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:42,332 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-31 17:21:42,332 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:42,333 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-31 17:21:42,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:42,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:42,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-31 17:21:42,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:42,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:42,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:42,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:42,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:42,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:42,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:42,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-31 17:21:42,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-31 17:21:44,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:44,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-31 17:21:44,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:44,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 17:21:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 17:21:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:21:44,007 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-31 17:21:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:44,169 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-31 17:21:44,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 17:21:44,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-31 17:21:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:44,170 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:21:44,171 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 17:21:44,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:21:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 17:21:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 17:21:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 17:21:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-31 17:21:44,175 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-31 17:21:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:44,176 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-31 17:21:44,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 17:21:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-31 17:21:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 17:21:44,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:44,177 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-31 17:21:44,177 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-31 17:21:44,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:44,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-31 17:21:44,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:44,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:44,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:44,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:44,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:44,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:44,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:44,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:44,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 17:21:44,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:44,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-31 17:21:44,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-31 17:21:46,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:46,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-01-31 17:21:46,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:46,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 17:21:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 17:21:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:21:46,006 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-31 17:21:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:46,124 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-31 17:21:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 17:21:46,124 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-31 17:21:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:46,124 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:21:46,124 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:21:46,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:21:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:21:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 17:21:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 17:21:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-31 17:21:46,128 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-31 17:21:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:46,129 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-31 17:21:46,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 17:21:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-31 17:21:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 17:21:46,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:46,129 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-31 17:21:46,129 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-31 17:21:46,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:46,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:46,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-31 17:21:46,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:46,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:46,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:46,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:46,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:46,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:46,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:46,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:46,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:46,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-31 17:21:46,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-31 17:21:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-31 17:21:47,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:47,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 17:21:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 17:21:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:47,728 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-31 17:21:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:47,851 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-31 17:21:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 17:21:47,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-31 17:21:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:47,852 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:21:47,853 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:21:47,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:21:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 17:21:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 17:21:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-31 17:21:47,856 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-31 17:21:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-31 17:21:47,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 17:21:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-31 17:21:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 17:21:47,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:47,857 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-31 17:21:47,857 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-31 17:21:47,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-31 17:21:48,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:48,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:48,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:48,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:48,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:49,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-31 17:21:49,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-31 17:21:50,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:50,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-31 17:21:50,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 17:21:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 17:21:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 17:21:50,216 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-31 17:21:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:50,361 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-31 17:21:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 17:21:50,362 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-31 17:21:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:50,363 INFO L225 Difference]: With dead ends: 103 [2019-01-31 17:21:50,363 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:21:50,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 17:21:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:21:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 17:21:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 17:21:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-31 17:21:50,367 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-31 17:21:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:50,367 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-31 17:21:50,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 17:21:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-31 17:21:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 17:21:50,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:50,368 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-31 17:21:50,369 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-31 17:21:50,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-31 17:21:50,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:50,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:50,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:50,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:50,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:50,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:51,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 17:21:51,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:51,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-31 17:21:51,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-31 17:21:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-31 17:21:52,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:52,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 17:21:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 17:21:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 17:21:52,482 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-31 17:21:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:52,665 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-31 17:21:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 17:21:52,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-31 17:21:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:52,666 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:21:52,666 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:21:52,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 17:21:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:21:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 17:21:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:21:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-31 17:21:52,671 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-31 17:21:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:52,672 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-31 17:21:52,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 17:21:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-31 17:21:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 17:21:52,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:52,672 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-31 17:21:52,673 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-31 17:21:52,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:52,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-31 17:21:53,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:53,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:53,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:53,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:53,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:53,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:53,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:53,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:53,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:53,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:53,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-31 17:21:53,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-31 17:21:54,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:54,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-31 17:21:54,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:54,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 17:21:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 17:21:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:54,647 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-31 17:21:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:54,815 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-31 17:21:54,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 17:21:54,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-31 17:21:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:54,816 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:21:54,816 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 17:21:54,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 17:21:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 17:21:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:21:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-31 17:21:54,821 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-31 17:21:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:54,821 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-31 17:21:54,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 17:21:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-31 17:21:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 17:21:54,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:54,822 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-31 17:21:54,822 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-31 17:21:54,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:54,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:54,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:54,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:54,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-31 17:21:55,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:55,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:55,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:55,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:55,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:55,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:55,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:55,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-31 17:21:55,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-31 17:21:57,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:57,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-31 17:21:57,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:57,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 17:21:57,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 17:21:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 17:21:57,156 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-31 17:21:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:57,312 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-31 17:21:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 17:21:57,313 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-31 17:21:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:57,314 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:21:57,314 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:21:57,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 17:21:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:21:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 17:21:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:21:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-31 17:21:57,319 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-31 17:21:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:57,319 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-31 17:21:57,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 17:21:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-31 17:21:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 17:21:57,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:57,320 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-31 17:21:57,320 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:57,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-31 17:21:57,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:57,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:57,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:57,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:57,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-31 17:21:58,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:58,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:58,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:58,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:58,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:58,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:58,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:58,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 17:21:58,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:58,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-31 17:21:58,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-31 17:22:00,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:00,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-31 17:22:00,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:00,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 17:22:00,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 17:22:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:22:00,203 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-31 17:22:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:00,339 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-31 17:22:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 17:22:00,339 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-31 17:22:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:00,340 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:22:00,340 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:22:00,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:22:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:22:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 17:22:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:22:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-31 17:22:00,343 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-31 17:22:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:00,344 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-31 17:22:00,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 17:22:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-31 17:22:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 17:22:00,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:00,344 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-31 17:22:00,344 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-31 17:22:00,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:00,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:00,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-31 17:22:01,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:01,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:01,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:01,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:01,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:01,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:01,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:01,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:01,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-31 17:22:01,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-31 17:22:02,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:02,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-31 17:22:02,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:02,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 17:22:02,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 17:22:02,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:22:02,786 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-31 17:22:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:02,948 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-31 17:22:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 17:22:02,948 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-31 17:22:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:02,949 INFO L225 Difference]: With dead ends: 118 [2019-01-31 17:22:02,950 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 17:22:02,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:22:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 17:22:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 17:22:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 17:22:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-31 17:22:02,953 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-31 17:22:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:02,954 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-31 17:22:02,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 17:22:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-31 17:22:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 17:22:02,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:02,954 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-31 17:22:02,955 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-31 17:22:02,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:02,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:02,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-31 17:22:03,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:03,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:03,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:03,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:03,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:03,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:03,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:03,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:03,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-31 17:22:03,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-31 17:22:05,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:05,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-31 17:22:05,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:05,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 17:22:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 17:22:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:22:05,485 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-31 17:22:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:05,623 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-31 17:22:05,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 17:22:05,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-31 17:22:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:05,624 INFO L225 Difference]: With dead ends: 121 [2019-01-31 17:22:05,624 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 17:22:05,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:22:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 17:22:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 17:22:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 17:22:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-31 17:22:05,628 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-31 17:22:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:05,629 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-31 17:22:05,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 17:22:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-31 17:22:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 17:22:05,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:05,629 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-31 17:22:05,629 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-31 17:22:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-31 17:22:06,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:06,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:06,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:06,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:06,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:06,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:06,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:06,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:06,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 17:22:06,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:06,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-31 17:22:06,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-31 17:22:08,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:08,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-31 17:22:08,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:08,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 17:22:08,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 17:22:08,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:22:08,593 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-31 17:22:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:08,748 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-31 17:22:08,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 17:22:08,748 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-31 17:22:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:08,749 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:22:08,749 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:22:08,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:22:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:22:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 17:22:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 17:22:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-31 17:22:08,752 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-31 17:22:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:08,753 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-31 17:22:08,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 17:22:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-31 17:22:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 17:22:08,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:08,753 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-31 17:22:08,753 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-31 17:22:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:08,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:08,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:08,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:08,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-31 17:22:09,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:09,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:09,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:09,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:09,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:09,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:09,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:09,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:09,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:09,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:09,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-31 17:22:09,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-31 17:22:12,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:12,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-31 17:22:12,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:12,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 17:22:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 17:22:12,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 17:22:12,141 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-31 17:22:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:12,302 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-31 17:22:12,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 17:22:12,303 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-31 17:22:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:12,304 INFO L225 Difference]: With dead ends: 127 [2019-01-31 17:22:12,304 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:22:12,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 17:22:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:22:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 17:22:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 17:22:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-31 17:22:12,309 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-31 17:22:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:12,309 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-31 17:22:12,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 17:22:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-31 17:22:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 17:22:12,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:12,310 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-31 17:22:12,310 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-31 17:22:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:12,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:12,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-31 17:22:13,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:13,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:13,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:13,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:13,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:13,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:13,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:13,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:13,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-31 17:22:13,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-31 17:22:15,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:15,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-31 17:22:15,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:15,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 17:22:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 17:22:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 17:22:15,156 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-31 17:22:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:15,309 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-31 17:22:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 17:22:15,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-31 17:22:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:15,311 INFO L225 Difference]: With dead ends: 130 [2019-01-31 17:22:15,311 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:22:15,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 17:22:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:22:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 17:22:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 17:22:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-31 17:22:15,315 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-31 17:22:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:15,315 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-31 17:22:15,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 17:22:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-31 17:22:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 17:22:15,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:15,316 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-31 17:22:15,316 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-31 17:22:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:15,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-31 17:22:16,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:16,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:16,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:16,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:16,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:16,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:16,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:16,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:17,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 17:22:17,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:17,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-31 17:22:17,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-31 17:22:19,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:19,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-31 17:22:19,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:19,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 17:22:19,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 17:22:19,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:22:19,161 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-31 17:22:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:19,310 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-31 17:22:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 17:22:19,311 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-31 17:22:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:19,311 INFO L225 Difference]: With dead ends: 133 [2019-01-31 17:22:19,312 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:22:19,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:22:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:22:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 17:22:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 17:22:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-31 17:22:19,316 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-31 17:22:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:19,317 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-31 17:22:19,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 17:22:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-31 17:22:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 17:22:19,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:19,317 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-31 17:22:19,317 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-31 17:22:19,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:19,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:19,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-31 17:22:20,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:20,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:20,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:20,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:20,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:20,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:20,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:20,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:20,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:20,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-31 17:22:20,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-31 17:22:22,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:22,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-31 17:22:22,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:22,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 17:22:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 17:22:22,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:22,510 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-31 17:22:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:22,664 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-31 17:22:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 17:22:22,665 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-31 17:22:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:22,665 INFO L225 Difference]: With dead ends: 136 [2019-01-31 17:22:22,665 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:22:22,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:22:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 17:22:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:22:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-31 17:22:22,669 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-31 17:22:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:22,670 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-31 17:22:22,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 17:22:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-31 17:22:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 17:22:22,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:22,671 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-31 17:22:22,671 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-31 17:22:22,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:22,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:22,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:22,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:22,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-31 17:22:23,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:23,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:23,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:23,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:23,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:23,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:23,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:23,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:23,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-31 17:22:23,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-31 17:22:25,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:25,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-31 17:22:25,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:25,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 17:22:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 17:22:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 17:22:25,961 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-31 17:22:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:26,338 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-31 17:22:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 17:22:26,338 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-31 17:22:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:26,339 INFO L225 Difference]: With dead ends: 139 [2019-01-31 17:22:26,339 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:22:26,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 17:22:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:22:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 17:22:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:22:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-31 17:22:26,342 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-31 17:22:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:26,343 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-31 17:22:26,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 17:22:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-31 17:22:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 17:22:26,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:26,343 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-31 17:22:26,343 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-31 17:22:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:26,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:26,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-31 17:22:28,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:28,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:28,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:28,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:28,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:28,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:28,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:28,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 17:22:28,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:28,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-31 17:22:28,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-31 17:22:30,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:30,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-01-31 17:22:30,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:30,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:22:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:22:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:22:30,917 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-31 17:22:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:31,542 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-31 17:22:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 17:22:31,543 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-31 17:22:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:31,543 INFO L225 Difference]: With dead ends: 142 [2019-01-31 17:22:31,543 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:22:31,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:22:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:22:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 17:22:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:22:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-31 17:22:31,547 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-31 17:22:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:31,547 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-31 17:22:31,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:22:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-31 17:22:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 17:22:31,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:31,548 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-31 17:22:31,549 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-31 17:22:31,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:31,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:31,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:31,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:31,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-31 17:22:32,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:32,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:32,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:32,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:32,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:32,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:32,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:32,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:32,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:32,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:32,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-31 17:22:32,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-31 17:22:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-31 17:22:35,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:35,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 17:22:35,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 17:22:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:35,917 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-31 17:22:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:36,136 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-31 17:22:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 17:22:36,137 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-31 17:22:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:36,138 INFO L225 Difference]: With dead ends: 145 [2019-01-31 17:22:36,138 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:22:36,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:22:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 17:22:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:22:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-31 17:22:36,142 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-31 17:22:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:36,142 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-31 17:22:36,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 17:22:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-31 17:22:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 17:22:36,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:36,143 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-31 17:22:36,143 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-31 17:22:36,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:36,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:36,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:36,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:36,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-31 17:22:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:37,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:37,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:37,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:37,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:37,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:37,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:37,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-31 17:22:37,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-31 17:22:39,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:39,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-31 17:22:39,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:39,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 17:22:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 17:22:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 17:22:39,779 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-31 17:22:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:40,041 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-31 17:22:40,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 17:22:40,041 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-31 17:22:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:40,042 INFO L225 Difference]: With dead ends: 148 [2019-01-31 17:22:40,042 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:22:40,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 17:22:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:22:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 17:22:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 17:22:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-31 17:22:40,047 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-31 17:22:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:40,047 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-31 17:22:40,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 17:22:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-31 17:22:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 17:22:40,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:40,048 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-31 17:22:40,048 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-31 17:22:40,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:40,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:40,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:40,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:40,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-31 17:22:41,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:41,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:41,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:41,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:41,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:41,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:41,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:42,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 17:22:42,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:42,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-31 17:22:43,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-31 17:22:45,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:45,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-31 17:22:45,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:45,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 17:22:45,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 17:22:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:22:45,488 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-31 17:22:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:45,901 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-31 17:22:45,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 17:22:45,901 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-31 17:22:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:45,902 INFO L225 Difference]: With dead ends: 151 [2019-01-31 17:22:45,902 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:22:45,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:22:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:22:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 17:22:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:22:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-31 17:22:45,906 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-31 17:22:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:45,907 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-31 17:22:45,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 17:22:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-31 17:22:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:22:45,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:45,907 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-31 17:22:45,907 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-31 17:22:45,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:45,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:45,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:45,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:45,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-31 17:22:47,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:47,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:47,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:47,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:47,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:47,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:47,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:47,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:47,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:47,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:47,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-31 17:22:47,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-31 17:22:50,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:50,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-31 17:22:50,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:50,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 17:22:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 17:22:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:50,094 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-31 17:22:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:50,358 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-31 17:22:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 17:22:50,359 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-31 17:22:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:50,360 INFO L225 Difference]: With dead ends: 154 [2019-01-31 17:22:50,360 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:22:50,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:22:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 17:22:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:22:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-31 17:22:50,365 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-31 17:22:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:50,365 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-31 17:22:50,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 17:22:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-31 17:22:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 17:22:50,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:50,366 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-31 17:22:50,366 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:50,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-31 17:22:50,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:50,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:50,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-31 17:22:51,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:51,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:51,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:51,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:51,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:51,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:51,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:51,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-31 17:22:51,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-31 17:22:54,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:54,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-31 17:22:54,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:54,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 17:22:54,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 17:22:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:22:54,802 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-31 17:22:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:55,018 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-31 17:22:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 17:22:55,018 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-31 17:22:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:55,019 INFO L225 Difference]: With dead ends: 157 [2019-01-31 17:22:55,019 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:22:55,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:22:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:22:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 17:22:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:22:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-31 17:22:55,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-31 17:22:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:55,025 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-31 17:22:55,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 17:22:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-31 17:22:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:22:55,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:55,026 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-31 17:22:55,026 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-31 17:22:55,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:55,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:55,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:55,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:55,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-31 17:22:56,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:56,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:56,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:56,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:56,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:56,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:22:56,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:56,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:57,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 17:22:57,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:57,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-31 17:22:57,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-31 17:23:00,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:00,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-31 17:23:00,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:00,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:23:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:23:00,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:23:00,681 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-31 17:23:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:00,981 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-31 17:23:00,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 17:23:00,982 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-31 17:23:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:00,983 INFO L225 Difference]: With dead ends: 160 [2019-01-31 17:23:00,983 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:23:00,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:23:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:23:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 17:23:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:23:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-31 17:23:00,990 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-31 17:23:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:00,991 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-31 17:23:00,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:23:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-31 17:23:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 17:23:00,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:00,992 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-31 17:23:00,992 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-31 17:23:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:00,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:00,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-31 17:23:02,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:02,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:02,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:02,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:02,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:02,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:23:02,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:02,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:02,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:02,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:02,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-31 17:23:02,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-31 17:23:05,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:05,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-31 17:23:05,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:05,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 17:23:05,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 17:23:05,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:23:05,730 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-31 17:23:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:05,979 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-31 17:23:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 17:23:05,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-31 17:23:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:05,980 INFO L225 Difference]: With dead ends: 163 [2019-01-31 17:23:05,980 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:23:05,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:23:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:23:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 17:23:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 17:23:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-31 17:23:05,989 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-31 17:23:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:05,989 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-31 17:23:05,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 17:23:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-31 17:23:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 17:23:05,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:05,990 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-31 17:23:05,990 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-31 17:23:05,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:05,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:05,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:05,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:05,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-31 17:23:07,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:07,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:07,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:07,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:07,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:07,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:23:07,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:07,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:07,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-31 17:23:07,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-31 17:23:10,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:10,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-31 17:23:10,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:10,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 17:23:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 17:23:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 17:23:10,921 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-31 17:23:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:11,175 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-31 17:23:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 17:23:11,175 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-31 17:23:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:11,176 INFO L225 Difference]: With dead ends: 166 [2019-01-31 17:23:11,176 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:23:11,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 17:23:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:23:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 17:23:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:23:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-31 17:23:11,180 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-31 17:23:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:11,180 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-31 17:23:11,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 17:23:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-31 17:23:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 17:23:11,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:11,181 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-31 17:23:11,181 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-31 17:23:11,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:11,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:11,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-31 17:23:12,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:12,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:12,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:12,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:12,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:12,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:23:12,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:12,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:13,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 17:23:13,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:13,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:13,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:23:13,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:23:13,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:23:13,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-31 17:25:18,428 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) stderr output: (error "out of memory") [2019-01-31 17:25:18,629 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:25:18,630 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-31 17:25:18,636 INFO L168 Benchmark]: Toolchain (without parser) took 256411.11 ms. Allocated memory was 132.1 MB in the beginning and 632.3 MB in the end (delta: 500.2 MB). Free memory was 106.3 MB in the beginning and 269.4 MB in the end (delta: -163.1 MB). Peak memory consumption was 337.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:25:18,638 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory is still 107.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:25:18,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.31 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 104.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-01-31 17:25:18,639 INFO L168 Benchmark]: Boogie Preprocessor took 22.16 ms. Allocated memory is still 132.1 MB. Free memory was 104.3 MB in the beginning and 103.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:25:18,639 INFO L168 Benchmark]: RCFGBuilder took 356.74 ms. Allocated memory is still 132.1 MB. Free memory was 103.3 MB in the beginning and 94.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:25:18,640 INFO L168 Benchmark]: TraceAbstraction took 255989.90 ms. Allocated memory was 132.1 MB in the beginning and 632.3 MB in the end (delta: 500.2 MB). Free memory was 93.7 MB in the beginning and 269.4 MB in the end (delta: -175.7 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. [2019-01-31 17:25:18,643 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.22 ms. Allocated memory is still 132.1 MB. Free memory is still 107.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.31 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 104.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.16 ms. Allocated memory is still 132.1 MB. Free memory was 104.3 MB in the beginning and 103.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.74 ms. Allocated memory is still 132.1 MB. Free memory was 103.3 MB in the beginning and 94.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255989.90 ms. Allocated memory was 132.1 MB in the beginning and 632.3 MB in the end (delta: 500.2 MB). Free memory was 93.7 MB in the beginning and 269.4 MB in the end (delta: -175.7 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...